1041 Be Unique （20 分)

1041 Be Unique （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⁵​) 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

AC代码

#include <iostream>
#include <map>
using namespace std;
int main() {
	int N, flag = 0;
	cin >> N;
	int *Bet = new int[N];	//根据人数开辟动态数组
	map<int, int> mp;	//记录所赌数字	//Bet数组顺次存储所赌数字
	for (int i = 0; i < N; i++) { cin >> Bet[i]; mp[Bet[i]]++; }
	for (int i = 0; i < N; i++) if (mp[Bet[i]] == 1) { cout << Bet[i]; flag = 1; break; }
	if (!flag) cout << "None";
	return 0;
}