题解 | #整型数组合并#，是太简单了，大家都不想做么

import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeSet;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            TreeSet<Integer> set = new TreeSet<>();
            int n = in.nextInt();
            for (int i = 0; i < n; i++) {
                set.add(in.nextInt());
            }
            int m = in.nextInt();
            for (int i = 0; i < m; i++) {
                set.add(in.nextInt());
            }
            Iterator<Integer> iterator = set.iterator();
            StringBuilder builder = new StringBuilder();
            while (iterator.hasNext()){
                Integer next = iterator.next();
                builder.append(next);
            }
            System.out.println(builder);
        }
    }
}