1041 Be Unique-PAT甲级

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<bits/stdc++.h>
using namespace std;
map<int,int>mp;
map<int,int>kk;//出现的次序； 
int main(){
	int n,x;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&x);
		mp[x]++;
		kk[x]=i;
	}
	int min_x=0x3f3f3f3f,val=-1;
	for(auto i:mp){
		if(i.second==1&&kk[i.first]<min_x){
			min_x=kk[i.first];
			val=i.first;
		}
	}
	if(val==-1) printf("None\n");
	else printf("%d\n",val);
	return 0;
}