#include <bits/stdc++.h>
using namespace std;
int main(){
    freopen ( "merge.in" , "r" , stdin);
    freopen ( "merge.out", "w" , stdout);
    set <int>::iterator it;
    set <int> p;
    set <int> q;
    int n , m;
    cin >> n >> m;
    for (int i = 0;i < n;i ++){
        int k;
        cin >> k;
        p.insert ( k );
    }
    for(int i = 0;i < m;i ++){
        int o;
        cin >> o;
        q.insert (o);
    }
    for(int x:q){
        p.insert(x);
    }
    for (it = p.begin(); it != p.end(); it++) {
        cout << *it << " ";
    }
    





    return 0;
}

#include<bits/stdc++.h>
using namespace std;
int sum[100010];
int main(){
	freopen("merge.in","r",stdin);
	freopen("merge.out","w",stdout);
	int a,b;
	cin >> a >> b;
    for(int i = 0;i < a + b;i ++){
    	cin >> sum[i];
	}
	sort(sum ,sum + a + b);
	int hui = 123456789;
	for(int i = 0;i < a + b;i ++){
		if(hui == sum[i]) {
			continue;
		}
		cout << sum[i] << ' ';
		hui = sum[i];
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int amp[100010];
int main(){
	freopen("merge.in","r",stdin);
	freopen("merge.out","w",stdout);
	int a,b;
	cin >> a >> b;
    for(int i = 0;i < a + b;i ++){
    	cin >> amp[i];
	}
	sort(amp ,amp + a + b);
	int hui = 123456789;
	for(int i = 0;i < a + b;i ++){
		if(hui == amp[i]) {
			continue;
		}
		cout << amp[i] << ' ';
		hui = amp[i];
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int sum[100010];
int main(){
    freopen("merge.in","r",stdin);
    freopen("merge.out","w",stdout);
    int a,b;
    cin >> a >> b;
    for(int i = 0;i < a + b;i ++){
        cin >> sum[i];
    }
    sort(sum ,sum + a + b);
    int hui = 123456789;
    for(int i = 0;i < a + b;i ++){
        if(hui == sum[i]) {
            continue;
        }
        cout << sum[i] << ' ';
        hui = sum[i];
        }
    return 0;
}

转载自鲁大师（2301026）