题解 做的太慢| #整型数组合并#

import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.util.stream.Collectors;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
      Scanner in = new Scanner(System.in);
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            String a = in.nextLine();
            String arr = in.nextLine();
            String b = in.nextLine();
            String brr = in.nextLine();


            String[] as = arr.split(" ");

            String[] bs = brr.split(" ");

            List<String> alist = Arrays.asList(as);
            List<String> blist = Arrays.asList(bs);

            Set<String> setA = new HashSet<>(alist);
            Set<String> setB = new HashSet<>(blist);
            setA.addAll(setB);

            Set<Integer> sum = new TreeSet<>();
            for (String s:setA) {
                sum.add(Integer.parseInt(s));

            }

            for (Integer s:sum) {
                System.out.print(s);
            }


        }
    }
}