BOJ 24085 - 希少な数 (Rare Number) [C++]

문제

링크

풀이

#include <iostream>
#include <map>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  map<int, int> mp;
  while (n--) {
    int x; cin >> x;
    mp[x]++;
  }
 
  int ans = 0, cnt = 1e9;
  for (auto [k, v] : mp) {
    if (v < cnt) {
      ans = k;
      cnt = v;
    }
  }
  cout << ans;
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}