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

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

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

    int pts[n];
    for (int i = 0; i < n; ++i){
        cin >> pts[i];
    }

    sort(pts, pts + n, greater<int>());

    int needed = k;
    for (int i = k; i < n && pts[i] == pts[i-1]; ++i){
        ++needed;
    }

    cout << needed;

    return 0;
}