题解 | #明明的随机数#

import java.util.*;

public class Main{
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int sum = scan.nextInt(); //获取总数n
        // TreeSet集合的特点是：元素不重复,元素有序
        TreeSet<Integer> set = new TreeSet<Integer>();
        while(sum!=0) {
            int a = scan.nextInt();
            set.add(a);
            sum--;
        }
        for (Integer i : set) {
             System.out.println(i);
        }
    }
}