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;

const int N = 2e3 + 7;
int a[N];

int main() {
    int n, k;
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; ++i)
        scanf("%d", &a[i]);
    
    sort(a, a + n, greater<int>());
    
    int i = k - 1;
    int x = a[i];
    while (i < n && a[i] == x)
        ++i;

    printf("%d", i);
    
    return 0;
}