#include <iostream> #include <vector> #include <algorithm> int main() { int n, k; std::cin >> n >> k; std::vector<int> a(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } std::sort(a.rbegin(), a.rend()); a.push_back(-1); while (a[k - 1] == a[k]) { k += 1; } std::cout << k << "\n"; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | #include <iostream> #include <vector> #include <algorithm> int main() { int n, k; std::cin >> n >> k; std::vector<int> a(n); for (int i = 0; i < n; ++i) { std::cin >> a[i]; } std::sort(a.rbegin(), a.rend()); a.push_back(-1); while (a[k - 1] == a[k]) { k += 1; } std::cout << k << "\n"; } |