1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
#include <iostream>
#include <algorithm>
using namespace std;

int tab[2005];
int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  for(int i = 0; i < n; i++)
    cin >> tab[i];
  sort(tab, tab + n, greater<int>());
  int lowest_score = tab[k - 1];
  while(tab[k] == lowest_score)
    k++;
  cout << k << '\n';
  return 0;
}