http://icpc.upc.edu.cn/problem.php?cid=1721&pid=1
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
int n,m,t,b,i,k,a[1000010];
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=1; i<=n; i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
k=0;
for(i=n; i>1; i--)
{
if(a[i]==a[i-1])
i--;
else
{
k++;
if(k==1)
printf("%d ",a[i]);
else
printf("%d\n",a[i]);
}
}
if(a[2]!=a[1])
printf("%d\n",a[1]);
}
}