#include <cstring> #include <cstdio> #include <algorithm> const int max_n = 10000; const int max_p = 150; int n, k; int points[max_n]; int players[max_p]; int main() { scanf("%d %d", &n, &k); for (int i = 0; i < max_p; ++i) players[i] = 0; for (int i = 0; i < n; ++i) scanf("%d", points + i); for (int i = 0; i < n; ++i) ++players[points[i]]; int ans = 0; for (int i = max_p - 1; i >= 0 && ans < k; --i) { ans += players[i]; } printf("%d\n", ans); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | #include <cstring> #include <cstdio> #include <algorithm> const int max_n = 10000; const int max_p = 150; int n, k; int points[max_n]; int players[max_p]; int main() { scanf("%d %d", &n, &k); for (int i = 0; i < max_p; ++i) players[i] = 0; for (int i = 0; i < n; ++i) scanf("%d", points + i); for (int i = 0; i < n; ++i) ++players[points[i]]; int ans = 0; for (int i = max_p - 1; i >= 0 && ans < k; --i) { ans += players[i]; } printf("%d\n", ans); return 0; } |