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
#include <iostream>
#include <algorithm>
#include <vector>
#include <iterator>

using namespace std;

int main() {
    int n {};
    int k {};
    cin >> n >> k;
    vector<int> a(n);
    for (int i=0; i<n; i++) {
        cin >> a[i];
    }
    sort(begin(a), end(a), greater<int>());
    for (int i=k; i<n; i++) {
        if (a[i] != a[i-1]) {
            break;
        }
        k++;
    }
    cout << k << endl;
    return 0;
}