Accepted
Code
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
unordered_map<int,int> mp;
for(int i=0; i<n; i++){
int x;
cin>>x;
mp[x]++;
}
int ans=0;
for(auto it: mp){
if(it.second==1){
ans=it.first;
break;
}
}
cout<<ans<<endl;
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1095 Uncovering the Lone Heart
- Contest
- Brain Booster #6
- Language
- C++11 (G++ 13.2.0)
- Submit At
- 2024-10-03 15:40:29
- Judged At
- 2024-12-17 11:36:22
- Judged By
- Score
- 100
- Total Time
- 41ms
- Peak Memory
- 2.777 MiB