673人阅读 评论(0)

# 1041. Be Unique (20)

100 ms

65536 kB

16000 B

Standard

CHEN, Yue

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

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
int cnt[10010],ori[100010];
int main()
{
int n;
cin>>n;
bool flag=true;
memset(cnt,0,sizeof(cnt));
for(int i=1;i<=n;i++)
{
cin>>ori[i];
cnt[ori[i]]++;
}
for(int i=1;i<=n;i++)
{
if(cnt[ori[i]]==1)
{
cout<<ori[i]<<endl;
flag=false;
break;
}
}
if(flag)cout<<"None\n";
return 0;
} 

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：209251次
• 积分：5377
• 等级：
• 排名：第5030名
• 原创：321篇
• 转载：9篇
• 译文：0篇
• 评论：43条
博客专栏
 从0开始刷LeetCode，备战面试——EasyVersion 文章：10篇 阅读：2516
 多校题集 文章：38篇 阅读：24513
 刷PAT，申Offer 文章：24篇 阅读：19816
 【打CF，学算法】 文章：49篇 阅读：34082
阅读排行