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
26
#include <cstdio>
#include <functional>
#include <algorithm>

const int maxn = 2000;
int a[maxn];

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::greater<int>());
    
    int additional_thsirts=0;
    int ind = k;
    while(ind < n && a[ind] == a[ind-1]) {
        additional_thsirts++;
        ind++;
    }

    printf("%d\n", k+additional_thsirts);

    return 0;
}