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

using namespace std;

vector <int> tab;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, k;
    int x;
    int akt;

    cin >> n >> k;

    for (int i = 0; i < n; i++)
    {
        cin >> x;
        tab.push_back(x);
    }
    
    sort(tab.begin(), tab.end(), greater<int>());

    /*for (auto iter = tab.begin(); iter != tab.end(); iter++)
        cout << (*iter) << " ";*/
    
    akt = tab[k - 1];
    while (k < n && tab[k] == akt)
    {
        akt = tab[k];
        ++k;
    }
    cout << k << "\n";
    
    return 0;
}