#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n{}, k{};
cin >> n >> k;
vector<int> a{};
int aa{};
for (int i = 0; i < n; i++) {
cin >> aa;
a.push_back(aa);
}
sort(a.begin(), a.end(), greater<int>());
int el = a[k-1];
int i = k;
while (i < n and a[i] == el) i++;
cout << i << "\n";
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | #include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n{}, k{}; cin >> n >> k; vector<int> a{}; int aa{}; for (int i = 0; i < n; i++) { cin >> aa; a.push_back(aa); } sort(a.begin(), a.end(), greater<int>()); int el = a[k-1]; int i = k; while (i < n and a[i] == el) i++; cout << i << "\n"; } |
English