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
//Author: Piotr Zielinski
#include<bits/stdc++.h>
using namespace std;

template<class C> C reversed(C c) {reverse(c.begin(),c.end()); return c;}
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define all(X) (X).begin(), (X).end()
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
typedef pair<int,int> pii;



int32_t main(){
    ios::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;

    vector<int> score(n);
    for(int i = 0;i < n;++i) {
        cin >> score[i];
    }

    sort(all(score), greater<int>());

    int ct = k;
    while(ct < n && score[ct] == score[k - 1]) ++ct;

    cout << ct << "\n";

    return 0;
}