1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include<cstdio>
#include<algorithm>

int input[3000];

int main() {
    int n, k;
    scanf("%i%i", &n, &k);
    
    for (int i = 0; i < n; ++i) {
        scanf("%i", &input[i]);
    }
    
    std::sort(input, input+n);
    
    int it = n - k;
    while(it > 0) {
        if(input[it] == input[it-1]) it--;
        else break;
    }
    
    printf("%i\n", n - it);
    
    return 0;
}