1041. Be Unique (20)

来源:互联网 发布:东京电视台 知乎 编辑:程序博客网 时间:2024/06/05 01:53
#include <iostream>#include <cstdio>#include <vector>using namespace std;#define N 10001int main(int argc, char **argv) {int count[N] = {};int n;cin >> n;vector<int> bets;bets.reserve(n);for(int i = 0; i < n; i ++) {int b;scanf("%d", &b);bets.push_back(b);count[b] ++;}int winner = 0;for(int i = 0; i < bets.size(); i ++) {if(count[bets[i]] == 1) {winner = bets[i];break;}}if(winner)cout << winner << endl;elsecout << "None" << endl;return 0;}

0 0
原创粉丝点击