1041 Be Unique (20)(20 分)
Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1, 10^4^]. The first one who bets on a unique number wins. For example, if there are 7 people betting on 5 31 5 88 67 88 17, then the second one who bets on 31 wins.
Input Specification:
Each input file contains one test case. Each case contains a line which begins with a positive integer N (<=10^5^) and then followed by N bets. The numbers are separated by a space.
Output Specification:
For each test case, print the winning number in a line. If there is no winner, print "None" instead.
Sample Input 1:
7 5 31 5 88 67 88 17
Sample Output 1:
31
Sample Input 2:
5 888 666 666 888 888
Sample Output 2:
None
找第一个不重复的数字。
#include<stdio.h>
#include<map>
using namespace std;
int main(){
int n;
scanf("%d",&n);
map<int,pair<int,int>> m;
for(int i=0;i<n;i++){
int t;
scanf("%d",&t);
if(m.find(t)==m.end()){
m[t]=make_pair(i,1);
}else{
m[t].second++;
}
}
int min=100000,val=-1;
for(auto it=m.begin();it!=m.end();it++){
if(it->second.second==1&&it->second.first<min)
{min=it->second.first;val=it->first;}
}
if(val==-1)printf("None");
else printf("%d",val);
return 0;
}