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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

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

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

    vector <int> V;

    for (int i=0;i<n;i++) {
        int x;
        cin >> x;
        V.push_back(x);
    }

    sort(V.begin(), V.end());

    int wnk= k;
    for (int i=n-k-1; i>=0 && V[i]==V[i+1] ;i--)
        wnk++;

    cout << wnk << '\n';

    return 0;
}