题解 | #明明的随机数#

import java.util.Scanner;

import java.util.HashSet;
import java.util.Comparator;
import java.util.stream.Collectors;
import java.util.List;
import java.util.Random;
import java.util.TreeSet;
import java.util.Iterator;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        HashSet<Integer> seth = new HashSet<>();
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int a = in.nextInt();
            if(a <= 0 || a > 500){
                break;
            }
             Random b = new Random();
             b.setSeed(500L);
            for(int i =  0; i < a;i++){
               int c = b.nextInt(500);
               seth.add(in.nextInt());
               
            } 
        }
        TreeSet<Integer> tree = new TreeSet<>((o1,o2)->o1.compareTo(o2));
        tree.addAll(seth);
        Iterator iterator = tree.iterator();
        while(iterator.hasNext()){
            System.out.println(iterator.next());
        }
        
    }
}