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

#pragma warning(disable : 4996)



using namespace std;

inline vector<int> tab(unsigned long k, unsigned long n){
    vector<int> a(n);

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

    sort(a.begin(), a.end());
    return a;
}

inline unsigned long Dzialanie(vector<int> a, unsigned long k, unsigned long n) {
    unsigned long wynik = 0;
    for (int i = (n - 1); i >= 0; i--) {
        if (k > 0) {
            if (i != 0) {
                if (a[i] == a[i - 1]) {
                    wynik++;
                    continue;
                }
            }
            k--;
            wynik++;
        }
        else {
            break;
        }

    }
    return wynik;
}

int main()
{
    ios_base::sync_with_stdio(0);
    
    unsigned long k = 0;
    unsigned long n = 0;
    cin >> n;   
    cin >> k;
    
    vector<int> a = tab(k, n);
    
    cout << Dzialanie(a, k, n);
    return 0;}