1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <iostream>
#include <algorithm>
using namespace std;
int tab[2000];
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k;
    cin >> n;
    cin >> k;
    for (int i = 0; i < n; i++)
        cin >> tab[i];
    sort(tab, tab + n, greater<int>());
    int min = tab[k-1];
    int dodatkowe = 0;
    for (int i = k; i <= n; i++)
        if (tab[i] == min)
            dodatkowe++;
    k += dodatkowe;
    cout << k;
    return 0;
}