思路
set(集合 -> 去重 + 排序)
#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
int n, m;
int main()
{
while(cin >> n >> m)
{
set<int> s;
for(int i = 1; i <= n + m; i ++ )
{
int x;
cin >> x;
s.insert(x);
}
bool flg = 0;
for(set<int>::iterator it = s.begin(); it != s.end(); it ++ )
{
if(flg)
cout << " ";
flg = 1;
cout << *it;
}
cout << endl;
}
return 0;
}