#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for(int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end(), greater<>()); int additional = 0; for(int i = k; i < n; i++){ if(a[k - 1] == a[i]) additional++; else break; } cout << additional + k << "\n"; 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 | #include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> a(n); for(int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end(), greater<>()); int additional = 0; for(int i = k; i < n; i++){ if(a[k - 1] == a[i]) additional++; else break; } cout << additional + k << "\n"; return 0; } |