1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>

using namespace std;

int n, k;

int main()
{
    cin >> n >> k;

    int x[n];

    for(int i = 0; i < n; i++) cin >> x[i];

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

    int g = 0;
    while(x[k+g-1] == x[k+g] && g <= n) g++;

    cout << k+g;
}