#if defined(EMBE_DEBUG) && !defined(NDEBUG) #include "embe-debug.hpp" #else #define LOG_INDENT(...) do {} while (false) #define LOG(...) do {} while (false) #define DUMP(...) do {} while (false) #endif #include <iostream> #include <queue> using namespace std; namespace { } int main() { iostream::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; priority_queue<int> Q; for (int i = 0; i < n; ++i) { int x; cin >> x; Q.push(x); } int res = 0; while (!Q.empty() && res < k) { int x = Q.top(); while (!Q.empty() && Q.top() == x) { ++res; Q.pop(); } } cout << res << endl; 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 34 35 36 37 38 39 40 41 42 43 44 | #if defined(EMBE_DEBUG) && !defined(NDEBUG) #include "embe-debug.hpp" #else #define LOG_INDENT(...) do {} while (false) #define LOG(...) do {} while (false) #define DUMP(...) do {} while (false) #endif #include <iostream> #include <queue> using namespace std; namespace { } int main() { iostream::sync_with_stdio(false); cin.tie(nullptr); int n, k; cin >> n >> k; priority_queue<int> Q; for (int i = 0; i < n; ++i) { int x; cin >> x; Q.push(x); } int res = 0; while (!Q.empty() && res < k) { int x = Q.top(); while (!Q.empty() && Q.top() == x) { ++res; Q.pop(); } } cout << res << endl; return 0; } |