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
36
37
38
39
40
41
42
43
#include <iostream>
#include <algorithm>

using namespace std;

int main() {

    int k, n;

    cin >> n >> k;

    int points[n];

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

    sort(points, points+n);

    int sCount = 0;
    int lastVal = 0;
    int val;
    bool check = true;
    int j = n-1;

    while(check) {
        val = points[j];
        if (lastVal == val) {
            ++sCount;
        } else if (sCount < k){
            ++sCount;
        } else {
            check = false;
        }
        lastVal = val;
        j--;
    } 


    cout << sCount;

    return 0;
}