Help me in solving MISSP problem

help
,
1

My issue

include <bits/stdc++.h>
using namespace std;

int main() {
int t;
cin>>t;
while(t–)
{
int n;
cin>>n;
int* arr= new int[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
int ans;
sort(arr,arr+n);
for(int i=0;i<n;i=i+2)
{
if(arr[i]!=arr[i+1] && i+1<n)
{
ans=arr[i];
break;
}
}
cout<<ans<<endl;
delete arr;
}

}

My code

#include <bits/stdc++.h>
using namespace std;

int main() {
int t;
cin>>t;
while(t--)
{
   int n;
   cin>>n;
   int* arr= new int[n];
   for(int i=0;i<n;i++)
   {
       cin>>arr[i];
   }
   int ans;
   sort(arr,arr+n);
   for(int i=0;i<n;i=i+2)
   {
       if(arr[i]!=arr[i+1] && i+1<n)
       {
           ans=arr[i];
           break;
       }
   }
   cout<<ans<<endl;
   delete[] arr;
}

}

Learning course: Arrays, Strings & Sorting
Problem Link: Chef and Dolls Practice Problem in - CodeChef

2

@anon57275312
the logic is calculate the xor of the whole array.