#include <cstdio> #include <algorithm> #include <functional> using namespace std; int main() { int n, k; scanf("%d %d", &n, &k); int A[n]; for (int i=0;i<n;i++) scanf("%d", &A[i]); sort(A, A+n, greater<int>()); int i = k; while (A[i] == A[k-1] && i<n) i++; printf("%d", i); }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | #include <cstdio> #include <algorithm> #include <functional> using namespace std; int main() { int n, k; scanf("%d %d", &n, &k); int A[n]; for (int i=0;i<n;i++) scanf("%d", &A[i]); sort(A, A+n, greater<int>()); int i = k; while (A[i] == A[k-1] && i<n) i++; printf("%d", i); } |