[BOJ] 4358 생태학 (JAVA)

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

4358번: 생태학

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.PriorityQueue;

public class Main {
	
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static StringBuilder sb = new StringBuilder();
    static double cnt;

    public static void main(String[] args) throws Exception {

        HashMap<String, Integer> map = new HashMap<>();
        while (true) {

            String input = br.readLine();

            if (input == null || input.isEmpty()) break;

            if (map.containsKey(input)) map.put(input, map.get(input) + 1);
            else map.put(input, 1);
            cnt++;

        }

        PriorityQueue<Tree> pq = new PriorityQueue<>();
        map.entrySet().forEach(x -> {
            pq.offer(new Tree(x.getKey(), x.getValue() / cnt * 100));
        });

        while(!pq.isEmpty()) {

            Tree t = pq.poll();
            sb.append(String.format("%s %.4f", t.name, t.cnt)).append("\n");

        }

        System.out.print(sb.toString());

    }

    static class Tree implements Comparable<Tree> {

        String name;
        double cnt;

        public Tree (String name, double cnt) {
            this.name = name;
            this.cnt = cnt;
        }

        @Override
        public int compareTo (Tree o) {
            return this.name.compareTo(o.name);
        }

    }

}