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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
// Problem: Koszulki [C]
// https://sio2.mimuw.edu.pl/c/pa-2021-1/p/kos/

#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cctype>
#include <vector>
#include <set>
#include <map>
using namespace std;
#define REP(i,n) for(int _n=(n), i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define FOREACH(e, v) for(auto const &e: v)
#define IN(e, s) (s).find((e)) != (s).end()
#define TRACE(x) cerr << "TRACE(" #x ")" << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << endl;
#define PB push_back
#define ST first
#define ND second
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())
typedef long long LL; typedef unsigned long long ULL; typedef unsigned short UST; typedef unsigned int UINT;
typedef vector<int> VI;
inline  void fix_io() { cin.tie(nullptr); ios::sync_with_stdio(false); }

bool comp(UST a, UST b) { return a > b; }

int main() {
    fix_io();
    UST n,k,a,i;
    vector<UST> v;
    cin >> n >> k;
    while (n--) {
        cin >> a;
        v.PB(a);
    }
    if (n == k) {
        cout << k << '\n';
        return 0;
    }
    sort(v.begin(),v.end(),comp);
    UST last = v[k-1];
    for (i=k; i<n; ++i) {
        if (v[i] < last) {
            cout << i << '\n';
            return 0;
        }
    }

    cout << i << '\n';
}