Submission #3456038

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int hist[210000];

int main()
{
  int N, K;
  cin >> N >> K;
  for (int i = 0; i < N; i++) {
    int A;
    cin >> A;
    hist[A]++;
  }
  
  vector<int> v;
  for (int i = 1; i <= 200000; i++) {
	if (hist[i] > 0) v.push_back(hist[i]);
  }
  sort(v.begin(), v.end());
  
  int ans = 0;
  for (int i = 0; i < (int)v.size() - K; i++) {
  	ans += v[i];
  }
  cout << ans << endl;
  
  return 0;
}
  

Submission Info

Judge Result