공부기록/SWEA

[SWEA] 1204번 최빈수 구하기

메델 2023. 10. 20. 18:12
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class Solution {
	
	public static void main(String[] args) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int T = Integer.parseInt(br.readLine());
		StringBuilder sb = new StringBuilder();
		
		for(int i=1; i<=T; i++) {
			
			int number = Integer.parseInt(br.readLine());
			sb.append("#").append(number).append(" ");
			
			int [] count = new int[101];
			StringTokenizer st = new StringTokenizer(br.readLine(), " ");
			
			
			while(st.hasMoreTokens()) {
				count[Integer.parseInt(st.nextToken())]++;
			}
			
			int maxCount = 0;
			int answer = 0;
			
			
			for(int j=0; j<101; j++) {
				if(count[j]>=maxCount) {
					answer = j;
					maxCount = count[j];
				}
			}
			
			sb.append(answer).append('\n');
			
		}
		
		System.out.print(sb.toString());

		
	}

}