[SWEA] 1204. [S/W 문제해결 기본] 1일차 - 최빈수 구하기(D2) / C++

https://swexpertacademy.com/main/code/problem/problemDetail.do

SW Expert Academy

---

#include <iostream>
using namespace std;
 
int scores[101];
 
int main()
{
    int T;
    cin >> T;
 
    for (int test_case = 1; test_case <= T; test_case++)
    {
        
        //점수마다 사람 수 배열 초기화
        memset(scores, 0, sizeof(scores));
 
        for (int i = 0; i < 1000; i++)
        {
            int score;
            cin >> score;
 
            scores[score]++;
        }
 
        int Most = 0;
        int result = 0;
        for (int i = 1; i < 101; i++)
        {
            if (scores[i] >= Most)
            {
                result = i;
                Most = scores[i];
            }
        }
 
        cout << "#" << test_case << " " << result << "\n";
    }
 
    return 0;
}