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

using namespace std;


int n, k;

int main(){
    ios_base::sync_with_stdio(0);
    cin >> n >> k;
    vector<int> input = vector<int>(n);

    for(int i = 0; i < n; i++){
        cin >> input[i];
    }

    sort(input.begin(), input.end());

    int given = 0;
    int pos = input.size()-1;

    while(given < k){
        while(pos > 0 && input[pos] == input[pos-1]){
            given++;
            pos--;
        }
        given++;
        pos--;
    }

    cout << given << endl;
}