import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
final int N=10010;
int[] tot=new int[N];
int l=0;
int a=in.nextInt();
int[] A=new int[a];
for(int i=0;i<a;i++){
A[i]=in.nextInt();
tot[l++]=A[i];
}
int b=in.nextInt();
int[] B=new int[b];
for(int i=0;i<b;i++){
B[i]=in.nextInt();
tot[l++]=B[i];
}
Arrays.sort(A);
Arrays.sort(B);
Arrays.sort(tot,0,a+b);
boolean p=false;
for(int i=0;i<a;i++){//交
if(Arrays.binarySearch(B,A[i])>=0) {
p=true;
System.out.print(A[i]+" ");
}
}
if(p) System.out.println();
System.out.print(tot[0]+" ");//并
for(int i=1;i<l;i++){
if(tot[i-1]!=tot[i]){
System.out.print(tot[i]+" ");
}
}
p=false;
for(int i=0;i<a;i++){//补
if(Arrays.binarySearch(B,A[i])<0) {
if(!p){
System.out.print("\n"+A[i]+" ");
p=true;
}
else {
System.out.print(A[i]+" ");
}
}
}
}
}
ALGO-10 集合运算
于 2022-03-07 19:20:39 首次发布