#include <iostream>
#include <bits/stdc++.h>
using namespace std;
void solve()
{
int values[121] = {0};
int value;
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> value;
values[value]++;
}
int s = 0;
for (int i = 120; i > 0; i--) {
s += values[i];
if (s >= k) {
break;
}
}
cout << s << endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie();
solve();
return 0;
}
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 27 28 29 30 31 32 33 | #include <iostream> #include <bits/stdc++.h> using namespace std; void solve() { int values[121] = {0}; int value; int n, k; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> value; values[value]++; } int s = 0; for (int i = 120; i > 0; i--) { s += values[i]; if (s >= k) { break; } } cout << s << endl; } int main() { ios_base::sync_with_stdio(0); cin.tie(); solve(); return 0; } |
English