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

using namespace std;

int main()
{
    int il, k, w, e;
    cin >> il >> k;
    e = k;
    int spis[il];
    for (int q = 0; q < il; q++){
        cin >> spis[q];
        spis[q] *= -1;
    }
    sort(spis, spis+il);
    int ost;
    w = 0;
    while (k != 0){
        ost = spis[w];
        w++;
        k--;
    }
    if (spis[w] == ost){
        while(spis[w] == ost){
            e++;
            w++;
        }
    }
    cout << e;
}