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
#include<bits/stdc++.h>

#define maxn 2000

using namespace std;

int tab[maxn];

bool por(int a, int b) {
    return a > b;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n,k;
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        cin >> tab[i];
    }
    
    sort(tab, tab+n, por);
    for (int i = k; i < n; ++i) {
        if (tab[i] != tab[i-1]) {
            cout << i << endl;
            return 0;
        }
    }
    cout << n << endl;
}