BOJ 11652: 카드 작성일 2020-02-15 https://www.acmicpc.net/problem/11652 2월동안 187문제 풀기(지난달 누적 87개) (28/187) 자나깨나 롱롱조심 1234567891011121314151617181920212223242526272829303132#include <bits/stdc++.h> using namespace std; int N; vector<long long> arr; long long tmp; int main() { scanf("%d", &N); for(int i = 0; i < N; i++) { scanf("%lld", &tmp); arr.push_back(tmp); } sort(arr.begin(), arr.end()); int cur = arr[0], cnt = 1, ans = arr[0], ansCnt = 1; for(int i = 1; i < N; i++) { if(arr[i] != cur) { if(ansCnt < cnt) { ans = cur; ansCnt = cnt; } cur = arr[i]; cnt = 1; } else cnt++; } if(ansCnt < cnt) { ans = cur; ansCnt = cnt; } cout << ans; }