PTA甲级 1041 Be Unique (C++)

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(\le 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

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-16 19:32:29
// All rights reserved.

#include <iostream>
#include <vector>
#include <unordered_map>

using namespace std;

int main(){
    int n;
    scanf("%d", &n);
    vector<int> d(n);
    unordered_map<int, int> map;
    

    for(int i = 0; i < n; ++i){
        scanf("%d", &d[i]);
        map[d[i]]++;
    }

    int i = 0;
    for(i = 0; i < n; ++i){
        if(map[d[i]] == 1){
            printf("%d\n", d[i]);
            return 0;
        }
    }

    if(i == n) printf("None\n");

    return 0;
}