题解 | #找到数组里的第k大数(C++)#
找到数组里的第k大数(C++)
https://www.nowcoder.com/practice/2d5e11b766654104ac91a54fe3a9f5db
#include<bits/stdc++.h> #include <vector> #include <algorithm> using namespace std; int main(){ int n,k; vector<int>a; // write your code here...... cin >> n >> k; int x; while (n--) { cin >> x; a.push_back(x); } sort(a.begin(), a.end()); cout << a[k - 1] << endl; return 0; }