NYOJ 839 合并

#include<stdio.h>#include<stdlib.h>int a[300];int cmp(const void *a,const void *b){return *(int *)a-*(int *)b;}int main(){int N;scanf("%d",&N);while(N--){int T,i;scanf("%d",&T);for(i=0;i<2*T;i++)scanf("%d",&a[i]);qsort(a,2*T,sizeof(a[0]),cmp);for(i=0;i<2*T-2;i++){if(a[i]!=a[i+1])printf("%d ",a[i]);}if(a[2*T-2]!=a[2*T-1])   printf("%d %d",a[2*T-2],a[2*T-1]);else   printf("%d",a[2*T-2]);printf("\n");}return 0;}