1041. Be Unique (20)

#include<iostream>
#include<vector>
#include<map>
using namespace std;

vector<int>nums;


int main(){
    
    map<int,int>::iterator it;
    map<int,int>map;
    int n;//number of nums
    cin>>n;
    while(n--){
        int num;
        cin>>num;
        it=map.find(num);
        if(it==map.end()){
            nums.push_back(num);
            map[num]=1;
        }else{
            map[num]++;
        }  
        it=map.end();
    } 
    int ans=-1;
    for(size_t i=0;i<nums.size();++i){
        if(map[nums[i]]>1)
            continue;
        else{
             ans= nums[i];
             break;
        }
    }
    if(ans==-1)
        cout<<"None\n";
    else
        cout<<ans<<"\n";
    
    return 0;    
}