[1차원 배열 연습 문제] 최빈수 구하기 - 1204

문제 : https://swexpertacademy.com/main/learn/course/lectureProblemViewer.do

SW Expert Academy

코드 : 

#include <iostream>

using namespace std;

int num[1000] = { 0 };


int solution(int max, int* check)
{
	int index = 0;
	for (int i = 100; i >= 0; i--)
	{
		if (check[i] == max)
		{
			index = i;
			break;
		}
	}
	return index;
}

int main()
{
	int N;
	cin >> N;

	int i = 0;
	while (i < N)
	{
		int c;
		cin >> c;
		
		int check[101] = { 0 };
		int max = 0;
		for (int k = 0; k < 1000; k++)
		{
			cin >> num[k];
			check[num[k]]++;
			if (max < check[num[k]])
			{
				max = check[num[k]];
			}
		}

		int v = solution(max, check);

		cout << "#" << c << " " << v << "\n";
		i++;
	}

	return 0;
}