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

using namespace std;

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

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

    int* data = new int[n]();

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

    sort(data, data + n);

    int collected = 0;
    for (int i = n - 1; i >= 0; i--)
    {
        if (collected < k || (i != n - 1 && data[i] == data[i + 1]))
        {
            collected++;
        }
        else
        {
            break;
        }
    }

    cout << collected << '\n';
}