[BOJ] 11652. 카드

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int n;
    cin >> n ;
 
    map<long long,int> m;
    map<long long,int>::iterator iter;
    
    for (int i=0; i<n; i++){
        long long s;
        cin >> s;
        if( m.find(s) == m.end())
            m.insert( {s,1} );
        else{
            iter = m.find(s);
            m[s] = iter->second + 1;
        }
    }
    
    long long ans_idx;
    int ans_value = 0;
    
    // [1]
    for(auto & it : m){
        if( it.second > ans_value ){
            ans_value = it.second;
            ans_idx = it.first;
        }
    }
    // [2]
    for(iter = m.begin(); iter != m.end(); iter++){
        if( iter->second > ans_value ){
            ans_value = iter->second;
            ans_idx = iter->first;
        }
    }
    
    cout << ans_idx << endl;
    return 0;
}