#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin>>n>>k; vector<int> a(n); for(int& v : a) { cin>>v; } sort(a.begin(), a.end(), greater<int>()); int total = k; for(int i = k; i < n; ++i) { if(a[i] != a[k - 1]) { break; } ++total; } cout<<total; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 | #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin>>n>>k; vector<int> a(n); for(int& v : a) { cin>>v; } sort(a.begin(), a.end(), greater<int>()); int total = k; for(int i = k; i < n; ++i) { if(a[i] != a[k - 1]) { break; } ++total; } cout<<total; } |