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
#include <iostream>
#include <algorithm>
using namespace std;
int n, k;
int tablica[2000];
int main(){

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

   }
   sort(tablica, tablica + n);

int gwarantowana = n-k;
if(tablica[gwarantowana] == tablica[0]){
    cout << n;
}
    else{
    while(tablica[gwarantowana-1] == tablica[gwarantowana]){
        gwarantowana = gwarantowana-1;
    }
    cout << n-gwarantowana;
    }

}