pat 1041. Be Unique

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, 104]. 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 (<=105) 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

思路：两次遍历，一次记录次数，一次判断。PS:题目有点小问题，实际的规模是10^5。

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=100005;
int n,a[maxn],vis[maxn];
int main(){
    scanf("%d",&n);
    memset(vis,0,sizeof(vis));
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
        vis[a[i]]++;
    }
    bool ok=false;
    for(int i=0;i<n;i++){
        if(vis[a[i]]==1){
            ok=true;
            printf("%d\n",a[i]);
            break;
        }
    }
    if(!ok){
        printf("None\n");
    }
    return 0;
}