1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
#include <algorithm>

int a[2000];

int main()
{
    int n, k;
    
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    std::sort(a, a+n);
    std::reverse(a, a+n);
    
    while (k < n && a[k] == a[k-1]) k++;
    
    printf("%d\n", k);
    
    return 0;
}