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

using namespace std;

int main() {
    std::ios_base::sync_with_stdio(false);

    int n, k;
    cin >> n >> k;

    vector<int> points;
    for(int i = 0; i < n; i++){
        int point;
        cin >> point;
        points.push_back(point);
    }

    sort(points.begin(), points.end(), greater<int>());
    int result = k;
    for(int i = k; i < n; i++){
        if(points[i] == points[i-1])
        {
            result++;
        }
        else {
            cout << result << endl;
            return 0;
        }
    }
    cout << result << endl;

    return 0;
}