{A} + {B}
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17189 Accepted Submission(s): 7202
注:同一個集合中不會有兩個相同的元素.
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 20005;
int a[N];
int main(){
int n,m,i;
while(~scanf("%d %d",&n,&m)){
for(i=0;i<m+n;i++)
scanf("%d",&a[i]);
sort(a,a+m+n);
int num = unique(a,a+m+n)-a; //去重後元素個數
for(i=0;i<num-1;i++)
printf("%d ",a[i]);
printf("%d\n",a[i]);
}
return 0;
}