Submission #2525303

---

Source Code Expand

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

using std::cin;
using std::cout;
using std::cerr;
using std::endl;

int main() {
  cin.tie(0);
  std::ios::sync_with_stdio(false);

  int N;
  std::vector<int> a;
  std::map<int, int> mp;
  std::set<int> st;

  cin >> N;
  a.resize(N);
  for (int i = 0; i < N; ++i) {
    cin >> a[i];
    st.insert(a[i]);
    mp[a[i]]++;
  }

  int ans = 0;

  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    if (*itr > mp[*itr]) {
      ans += mp[*itr];
    }
  else if (*itr < mp[*itr]) {
      ans += mp[*itr] - *itr;
    }
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result