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
#include <bits/stdc++.h>
using namespace std;
#define IOS                       \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define repV(i, a, n) for (int i = n; i >= a; i--)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
constexpr int M = 2e3 + 5;
int n, k, t[M], ans;

void solve()
{
    cin >> n >> k;
    rep(i, 1, n) cin >> t[i];
    sort(t + 1, t + n + 1, greater<int>());
    rep(i, 1, n)
    {
        if (ans >= k)
        {
            if (t[i] == t[i - 1])
                ++ans;
            else
                break;
        }
        else
            ++ans;
    }
    cout << ans << endl;
}

int main()
{
    IOS
    solve();
}