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
#include <iostream>
#include <algorithm>
using namespace std;
const int N=200;
int tab[N];
int main () {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);

  int n, k, x, grst=0;
  cin >> n >> k;
  for (int i=0; i<n; i++)
  {
    cin >> x;
    tab[x]++;
    grst=max(grst, x);
  }
  sort(tab, tab+grst);
  int result=0;
  for (int i=grst-1; i>=grst-k; i--)
  {
    result+=tab[i];
    //cout << i << " " << result << " " << tab[i] << endl;
  }
  cout << result;
  return 0;
}