[BOJ] 백준 2910 빈도 정렬

[문제]

https://www.acmicpc.net/problem/2910

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Main {
	static class Num{
		int num,cnt;
		Num(int num,int cnt){
			this.num = num;
			this.cnt = cnt;
		}
	}
    public static void main(String[] args) throws IOException {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringBuilder sb = new StringBuilder();
    	StringTokenizer st = new StringTokenizer(br.readLine());
    	int n = Integer.parseInt(st.nextToken());
    	int c = Integer.parseInt(st.nextToken());
    	List<Num> list = new ArrayList<>();
    	st = new StringTokenizer(br.readLine());
    	for(int i=0;i<n;i++) {
    		int v = Integer.parseInt(st.nextToken());
    		boolean found = false;
    		for(Num num : list) {
    			if(num.num == v) {
    				num.cnt++;
    				found = true;
    			}
    		}
    		if(!found) {
    			list.add(new Num(v,1));
    		}
    	}
    	list.sort((a,b)->{
    		return b.cnt - a.cnt;
    	});
    	for(Num numInfo : list) {
    		for(int i=0;i<numInfo.cnt;i++) {
    			sb.append(numInfo.num + " ");
    		}
    	}
    	System.out.println(sb);
    }
}