BOJ 11652: 카드

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

  • 2월동안 187문제 풀기(지난달 누적 87개) (28/187)
  • 자나깨나 롱롱조심
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
#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;
}