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
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
const int MAKS = 3*1e5 + 2;
const int MAXA = 2*1e7 + 2;
const int MOD = 1e9+7;
int tab[2002];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n,k; cin >> n >> k;
    for(int i = 0; i < n; i++)
    {
        cin >> tab[i];
    }
    sort(tab,tab + n);
    int ans = 0;
    for(int i = n-1; i >= 0; i--)
    {
        if(k > 0)
        {
            //cout << i << " " << tab[i] << " " << k << "\n";
            int j = i;
            while(j>=0 && tab[j] == tab[i])
            {
                j--;
                k--;
                ans++;
            }
            i = j+1;
        } else
        {
            break;
        }
    }
    cout << ans;
}