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 <iostream>
#include<algorithm>
using namespace std;



int main()
{
    int i, n, k;
    int tab[2021] = { 0 };
    cin >> n >> k;
    for ( i = 0; i < n; i++) {
        cin >> tab[i];
    }
    sort(tab, tab + n, greater < int >());
    for ( i = 0; i < n; i++) {
        k--;
        if (k <= 0 && tab[i] != tab[i + 1]) {
            break;
        }
        
    }
    i++;
    cout<< i << '\n';
    return 0;
}