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

int main() {

    ios_base::sync_with_stdio(0);
    int n,q;
    cin >> n >> q;
    vector<int> vec(n);
    for(int k=0;k<n;k++)
        cin >> vec[k];
    sort(vec.begin(),vec.end(),greater<int>());
    int res = 0;
    int last = -1;
    for(int k=0;k<n;k++) {

        if( q > 0) {
            res++;
            last = vec[k];
        }
        else {
            if(last == vec[k])
                res++;
            else
                break;
        }
        q--;
    }
    cout << res <<endl;
}