백준 11652번: 카드 - C++

[문제]

https://www.acmicpc.net/problem/11652

11652번: 카드

 

[풀이]

정렬

 

[코드]

 

#include <bits/stdc++.h>

using namespace std;

int n;

long long a[100005];

int main(void){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i=0; i<n; i++)
        cin >> a[i];
    sort(a, a+n);
    
    int cnt = 0;
    long long mxval= -(111 <<62)-1;
    int mxcnt = 0;
    for(int i=0; i<n; i++) {
        if(i==0 || a[i-1] == a[i]) cnt++;
        else{
            if(cnt > mxcnt){
                mxcnt = cnt;
                mxval = a[i-1];
            }
            cnt = 1;
        }
    }
    if(cnt > mxcnt) mxval = a[n-1];
    cout << mxval;
}