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

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    vector <int> punkty(n);

    for(auto& p : punkty)
        cin >> p;

    sort(punkty.begin(), punkty.end(), [](int a, int b) { return a > b; });

    int d = 0;
    int pre = -1;

    for (auto& p : punkty)
    {
        if (d >= k and pre != p)
        {
            break;
        }
        ++d;
        pre = p;
    }

    cout << d << "\n";

    return 0;
}