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