题解 | #字符串排序#

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

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int total = Integer.parseInt(in.nextLine());
        TreeMap<String, Integer> tm = new TreeMap<>();

        for (int i = 0; i < total; i++) {
            String key = in.nextLine();
            if (tm.containsKey(key)) {
                tm.put(key, tm.get(key) + 1);
            } else {
                tm.put(key, 1);
            }
        }
        for (Map.Entry<String, Integer> entry : tm.entrySet()) {
            for (Integer integer = 0; integer < entry.getValue(); integer++) {
                System.out.println(entry.getKey());
            }
        }

    }
}