#include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf("%d %d", &n, &k); vector<int> a(n); for(int i = 0; i < n; i++) { scanf("%d", &a[i]); } sort(a.begin(), a.end()); int i = n-k-1; while(i >= 0 && a[i] >= a[n-k]) i--; printf("%d", n-i-1); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | #include <bits/stdc++.h> using namespace std; int main() { int n, k; scanf("%d %d", &n, &k); vector<int> a(n); for(int i = 0; i < n; i++) { scanf("%d", &a[i]); } sort(a.begin(), a.end()); int i = n-k-1; while(i >= 0 && a[i] >= a[n-k]) i--; printf("%d", n-i-1); } |