#include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(); 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>()); int cutoff = a[k-1]; int z = k; while (z < n && a[z] == cutoff) z++; cout << z << '\n'; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | #include <iostream> #include <algorithm> #include <vector> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(); 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>()); int cutoff = a[k-1]; int z = k; while (z < n && a[z] == cutoff) z++; cout << z << '\n'; } |