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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    int n, k;
    cin>>n>>k;
    vector<int> w;
    for (int i=0; i<n; ++i)
    {
        int a;
        cin>>a;
        w.push_back(a);
    }
    sort(w.begin(), w.end());
    reverse(w.begin(), w.end());
    while (k<n && w[k-1]==w[k])
        ++k;
    cout<<k<<endl;
    return 0;
}