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
27
28
29
30
31
32
33
34
#include <cstdio>
#include <algorithm>

using namespace std;


int t[2001];

int main()
{
  int n, k;
  scanf("%d %d", &n, &k);
  
  for (int i = 1; i <= n; i++)
  {
    scanf("%d", t + i);
  }
  
  sort(t + 1, t + n + 1);
  reverse(t + 1, t + n + 1);
  
  int i = k;
  int pop = t[k];
  while (i <= n && pop == t[i])
  {
    i++;
    k++;
  }
  
  printf("%d\n", k - 1);
  
  
  return 0;
}