Algorithm/acmicpc.net/source/20113.cpp at master · tdm1223/Algorithm · GitHub

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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
// 20113. 긴급 회의
// 2021.09.09
// 구현
#include<iostream>

using namespace std;

int arr[101];
int main()
{
    int n;
    cin >> n;

    int k;
    for (int i = 0; i < n; i++)
    {
        cin >> k;
        arr[k]++;
    }

    int maxValue = 0;
    for (int i = 1; i <= n; i++)
    {
        if (arr[i] >= maxValue)
        {
            maxValue = arr[i];
        }
    }

    int cnt = 0;
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        if (arr[i] == maxValue)
        {
            ans = i;
            cnt++;
        }
    }

    if (cnt == 1)
    {
        cout << ans << endl;
    }
    else
    {
        cout << "skipped" << endl;
    }
    return 0;
}