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
#include <iostream>
#include <algorithm>

using namespace std;

int points[2000];

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

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

  for (int i = 0; i < n; i++)
    cin >> points[i];

  sort(points, points + n);

  int smallest = points[n - k];

  int result = k;

  for (int i = n - k - 1; i >= 0; i--)
    if (points[i] == smallest)
      result++;
    else
      break;

  cout << result << "\n";

  return 0;
}