Submission #1861613

---

Source Code Expand

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

#include <cmath>
#include <cstdlib>
#include <climits>

//#include <stdio.h>
//#include <stdlib.h>
using namespace std;

#define debug false

int main(int argc, char *argv[]){

  int N, K;
  cin >> N >> K;
  int tmp;
  map<int, int> mp;
  vector<int> v;
  for(int i = 0; i < N; i++){
    cin >> tmp;
    mp[tmp]++;
    if(mp[tmp] == 1) v.push_back(tmp);
  }
  ///show_vector(v);

  int counter = 0;
  RESTART :
  int mini_ele;
  int mini = INT_MAX;
  for(int i = 0; i < v.size(); i++){
    if(mini > mp[ v[i] ]){
      mini_ele = i;
      mini = mp[ v[i] ];
    }
  }
  if(v.size() <= K){
    cout << 0 << endl;
    return 0;
  }
  counter += mp[ v[mini_ele] ];
  v.erase(v.begin() + mini_ele);
  if(K < v.size()) goto RESTART;
  cout << counter << endl;
  //show_vector(v);
  return 0;
}

Submission Info

Judge Result