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

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