题解 | #找到数组里的第k大数(C++)#

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,k;
	cin >> n >> k;
	vector<int>a;
	// write your code here......
	for (int i = 0; i < n; ++i)
	{
		int num;
		cin >> num;
		a.push_back(num);
	}
	sort(a.begin(), a.end());
	cout << a[k-1];
	return 0;
}

第k大数，题目有点迷惑人。给的测试用例不如说是第k小数...