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

int P[3000];

int main() {
  std::ios_base::sync_with_stdio(0);
  int n,k;
  std::cin >> n >> k;
  for (int i=0;i<n;++i) {
    std::cin >> P[i];
  }
  --k;
  std::sort(P, P+n, std::greater<int>());
  int kk = k;
  while (kk < n && P[kk] == P[k]) ++kk;
  std::cout << kk << std::endl;
  return 0;
}