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

using namespace std;
typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(0);
    ll n, k;
    cin >> n >> k;
    vector<ll> v(n);

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

    sort(v.rbegin(), v.rend());

    ll id = k-1;
    while (id + 1 < n && v[id + 1] == v[k-1]) {
        id++;
    }
    cout << id + 1 << endl;
}