1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    std::sort(a.begin(), a.end(), greater<int>());
    int result = k;
    while (result < n && a[result] == a[k - 1])
    {
        ++result;
    }
    cout << result;
    return 0;
}