SWEA_1204) 최빈수 구하기

1204) 최빈수 구하기 (19.10.04)


문제 링크 (SW Expert Academy)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
import java.io.*;
import java.util.*;

public class Solution {
    public static void main(String args[]) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        
        StringTokenizer tk;
        int t = Integer.parseInt(br.readLine());
    
        for(int i=1;i<=t;i++) {
            int n = Integer.parseInt(br.readLine());
            
            tk = new StringTokenizer(br.readLine());
            
            int[] bin = new int[101];
            
            int max = 0;
            for(int j=0;j<1000;j++) {
                int num = Integer.parseInt(tk.nextToken());
                bin[num] = bin[num]+1;
                
                if(max<bin[num]) max = bin[num];
            }
            
            bw.write("#" + n + " ");
            for(int l=100; l>=0; l--) {
                if(bin[l]==max) {
                    bw.write(l+"\n");
                    break;
                }
            }
        }
        
        bw.flush();
        bw.close();
    }
}
cs

댓글

댓글 쓰기

이 블로그의 인기 게시물