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