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

using namespace std;

#define MAX_N 2007

int n, k, result;
int pkt[MAX_N];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  result = k;
  for (int  i = 1; i <= n; i++) {
    cin >> pkt[i];
  }

  sort(pkt + 1, pkt + n + 1, greater<int>());

  while (pkt[result + 1] == pkt[k]) {
    result++;
  }
  cout << result;
}