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

#include<bits/stdc++.h>
using namespace std;
int main() {
    int n, k;
    vector<int>a;
    // write your code here......
    int x;

    cin >> n >> k;
    while (cin >> x) {
        a.push_back(x);
    }

    sort(a.begin(), a.end());

    auto iter = a.begin() + k - 1;
    cout << *iter << endl;

    return 0;
}