提交时间:2025-05-01 10:49:51
运行 ID: 10141
#include <bits/stdc++.h> using namespace std; int a[1010] = {0},b[1010] = {0}; int main() { int n,m; cin>>n; int c[100010] = {0}; int f = 0; for(int i = 0;i < n;i++) { cin>>a[i]; c[f] = a[i]; f++; } cin>>m; for(int i = 0;i < m;i++) { cin>>b[i]; c[f] = b[i]; f++; } int d[n + m + 1] = {0}; sort(a,a + n); sort(b,b + m); sort(c,c + n + m); int g = 0; int ffhh = 0; if(n < m) { swap(n,m); swap(a,b); ffhh = 1; } for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { if(a[i] == b[j]) { cout<<a[i]<<" "; d[g] = a[i]; g++; } } } cout<<endl; if(ffhh) { swap(n,m); swap(a,b); } int temp = c[0]; for(int i = 0;i <= n + m;i++) { int sum = 0; cout<<temp<<" "; for(int j = i;;j++) { if(c[j] != 0 && c[j] != temp) { sum = j;break; } } temp = c[sum]; i = sum; } cout<<endl; for(int i = 0;i < n;i++) { int flag = 0; for(int j = 0;j < g;j++) { if(a[i] == d[j]) { flag = 1; break; } } if(!flag) { cout<<a[i]<<" "; } } return 0; }