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

문제

 

#include <iostream>

int freq[101];

void init() {
    for (int i = 0; i < 101; i++) {
        freq[i] = 0;
    }
}

int main() {
    int tc = 0;
    std::cin >> tc;

    for (int i = 1; i < tc + 1; i++) {
        int number_of_tc = 0;
        std::cin >> number_of_tc;

        init();

        for (int j = 0; j < 1000; j++) {
            int score = 0;
            std::cin >> score;
            freq[score]++;
        }

        int maximum_count = 0;
        int maximum_index = 0;
        for (int j = 100; j > 0; j--) {
            if (freq[j] > maximum_count) {
                maximum_count = freq[j];
                maximum_index = j;
            }
        }

        std::cout << "#" << number_of_tc << " " << maximum_index << "\n";
    }

    return 0;
}