Help me in solving MISSP problem

help
,
1

My issue

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

int main() {

int n,p,q;
cin>>n>>p;

 unordered_map<int,int>mp;

for(int i=0;i<p;i++){
cin>>q;
mp[q]++;
}
for(auto x:mp){
if(x.second%2!=0)
return x.first;
}
return 0;

}

My code

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


int main() {

   int n,p,q;
   cin>>n>>p;
   
     unordered_map<int,int>mp;
   for(int i=0;i<p;i++){
       cin>>q;
       mp[q]++;
   }
   for(auto x:mp){
       if(x.second%2!=0)
       return x.first;
   }
   return 0;
	

}

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

2

@ankit1272003
here i have corrected your code

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


int main() {

int t;
cin>>t;
while(t--)
{
   int n,p,q;
   cin>>p;
   
     unordered_map<int,int>mp;
   for(int i=0;i<p;i++){
       cin>>q;
       mp[q]++;
   }
   for(auto x:mp){
       if(x.second%2!=0)
       {
       cout<<x.first<<endl;
       break;
   }
   }
}
}