1041 Be Unique （20 分)

#include <iostream>
#include <cstdio>
using namespace std;

const int maxn = 100010;
const int maxv = 10010;
int a[maxv];
int b[maxn];
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int tmp;
		cin >> tmp;
		a[tmp]++;
		b[i] = tmp;
	}
	bool flag = false;
	for (int i = 0; i <n; i++) {//范围到n即可
								//范围不是maxv,否则报错,扣二分
		if (a[b[i]] == 1) {
			cout << b[i];
			flag = true;
			break;
		}
	}
	if(flag==false)
		printf("None");
	return 0;
}