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

void solve()
{
    vector<int> a;
    int n, k, tmp;
    cin >> n >> k;
    for(int i = 0; i < n; i++) {
        cin >> tmp;
        a.push_back(tmp);
    }

    sort(a.begin(), a.end());

    while(n - k - 1 >= 0 && a[n - k] == a[n - k - 1]) {
        k++;
    }

    cout << k;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    solve();

    return 0;
}