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

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

swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;

// 210128
// 1204. [S/W 문제해결 기본] 1일차 - 최빈수 구하기

public class SWEA1204 {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in); 
		
		int T = sc.nextInt();
		for(int tc=0; tc<T; tc++) {
			int TN = sc.nextInt();
			
			int[] arr = new int[101];
			int maxScore = -1;
			int maxCnt = -1;
			for (int stu=0; stu<1000; stu++) {
				int score = sc.nextInt();
				arr[score] += 1;
				if (arr[score] > maxCnt) {
					maxCnt = arr[score];
					maxScore = score;
				} else if (arr[score] == maxCnt) {
					// 최빈수가 여러 개 일 때에는 가장 큰 점수
					if (score >= maxScore) {
						maxScore = score;
						maxCnt = arr[score];
					}
				}
			} // for
			System.out.println("#" + TN + " " + maxScore);
			
		}
		
		sc.close();
	} // main

}