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

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


    return 0;
}