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
32
33
34
35
#include <iostream>
#include <vector>

using namespace std;

int compare (const void * a, const void * b) {
    return ( *(int*)b - *(int*)a );
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n,k;
    cin >> n;
    cin >> k;

    vector<int> v;

    int a;
    for(int i = 0; i < n; i++) {
        cin >> a;
        v.push_back(a);
    }
    v.push_back(-1);

    qsort(&v[0], v.size(), sizeof(int), compare);

    while(v[k-1] == v[k]) {
        k++;
    }

    cout << k << endl;
    return 0;
}