[SWEA] 최빈수 구하기(1204, 자바)

 

 

import java.util.Scanner;
import java.io.FileInputStream;

class Solution
{
	public static void main(String args[]) throws Exception
	{
		
		Scanner sc = new Scanner(System.in);
		int T;
        int max=-1;
        int answer=0;
        
		T=sc.nextInt();
        
		for(int test_case = 1; test_case <= T; test_case++)
		{
            int[] d= new int[101];
            int n=sc.nextInt();
			max=-1;
            
            for(int i=0;i<1000;i++){
                int in=sc.nextInt();
                d[in]+=1;
                if(max<d[in]){
					max=d[in];
                    answer=in;
                }
               else	if(max==d[in]) { 
                    if(answer<in){
						answer=in;
                    }
                }
		}
            System.out.println("#"+n+" "+answer);
	}
}
}