题解 | #字符串排序#

import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int num = in.nextInt();
        TreeMap<String, Integer> map = new TreeMap();
        while (in.hasNext()) { // 注意 while 处理多个 case
            String a = in.nextLine();
            //多了一个空格的输入不晓得为啥
            if (a.trim().equals("")) {
                continue;
            }
            if (!map.containsKey(a)) {
                map.put(a, 1);
            } else {
                int temp = map.get(a);
                map.put(a, ++temp);
            }
        }
        Set<String> set = map.keySet();
        for (String str : set) {
            for (int i = 0; i < map.get(str); i++) {
                System.out.println(str);
            }
        }
    }
}