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 <algorithm>
#include <iostream>
using namespace std;
const int MAXN = 2000;

#define FOR(i, n) for(int i = 0, __n = (n); i < __n; i++)



int p[MAXN];
int main() {
  ios_base::sync_with_stdio(0);

  int n, k; cin  >> n >> k;

  FOR(i, n) cin >> p[i];

  sort(p, p+n);
  reverse(p, p+n);

  while(k<n && p[k] == p[k-1]) k++;

  cout << k << endl;;
}