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

using namespace std;

int ks[130] = {0};

int main() {
    ios::sync_with_stdio(false);

    int n, k, ck = 0;
    cin >> n >> k;
    for(int i = 0; i < n; i++) {
        int x;
        cin >> x;
        ks[x] += 1;
    }
    for(int i = 120; i > 0; i--) {
        ck += ks[i];
        if (ck >= k) {
            break;
        }
    }
    cout << ck << endl;
    return 0;
}