#include <bits/stdc++.h> #define int long long using namespace std; int o,n; int a[100001]; int vis[100001]; signed main(){ // freopen("inequality.in","r",stdin); // freopen("inequality.out","w",stdout); scanf("%lld",&o); while (o--){ scanf("%lld",&n); for (int i=1;i<=n;i++) scanf("%lld",&a[i]); memset(vis,0,sizeof(vis)); vector<int> t; for (int i=1;i<=n;i++){ vis[a[i]]++; if (vis[a[i]]==1){ t.push_back(a[i]); } } sort(a+1,a+n+1); } return 0; }