#include <algorithm>
#include <iostream>
#include <vector>
int main() {
using namespace std;
int n, k;
cin >> n >> k;
vector<int> A(n);
for(int i = 0; i < n; i++) cin >> A[i];
sort(A.begin(), A.end());
reverse(A.begin(), A.end());
int i;
for(i = k - 1; i < n && A[i] == A[i + 1]; i++);
cout << i + 1 << "\n";
return 0;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | #include <algorithm> #include <iostream> #include <vector> int main() { using namespace std; int n, k; cin >> n >> k; vector<int> A(n); for(int i = 0; i < n; i++) cin >> A[i]; sort(A.begin(), A.end()); reverse(A.begin(), A.end()); int i; for(i = k - 1; i < n && A[i] == A[i + 1]; i++); cout << i + 1 << "\n"; return 0; } |
English