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
27
28
29
30
31
#include<bits/stdc++.h>

using namespace std;

int a[121];

int main() {
    int n, k;
    scanf("%d%d", &n, &k);

    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }

    if (k == n) {
        printf("%d\n", k);
        return 0;
    }

    sort(a, a + n, std::greater<int>());

    int prev = -1, c = 0;
    while (k > 0 || prev == a[c]) {
        prev = a[c];
        --k;
        ++c;
    }

    printf("%d\n", c);
    return 0;
}