没有超时，但是全WA，样例过了，疑似是初始化问题，

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
long long t,n,a[50005],c[50005],tot,mx=0x7f7f7f7f7f7f7f7f;
long long pre;
struct P{
	long long id,v;
}b[50005];
bool cmp(P a,P b)
{
	return a.v<b.v;
}
int main()
{
	cin>>t;
	while(t--){
		cin>>n;
		memset(b,0,sizeof b);
		memset(c,0x7f,sizeof c);
		for(int i=1;i<=n;i++){
			c[i]=mx;
			cin>>a[i];
			b[i].v=a[i];
			b[i].id=i;
		}
		sort(b+1,b+1+n,cmp);
		pre=mx;
		for(int i=1;i<=n;i++){
			if(b[i].v==pre)continue;
			pre=b[i].v;
			c[b[i].id]=b[i].v;
		}
		for(int i=1;i<=n;i++){
			if(c[i]!=mx)cout<<c[i]<<" ";
		}
		cout<<"\n";
	}
    return 'orz';
}