1041. Be Unique

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⁴]. 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

#include <cstdio>

#include <cstdlib>

#include<iostream>

#include <deque>

#include <queue>

#include <cstring>

#include <vector>

#include<string>

#include <iomanip>

#include<algorithm>

using namespace std;

#define max1 100000

int main()

{

   int n;

   cin>>n;

   int flag=0;

   int count1[100001]={0};

   vector<int>nums;

   for(int i=0;i<n;i++)

   {

       int a;

       cin>>a;

       if(count1[a]==0)

        nums.push_back(a);

       count1[a]++;

   }

   for(int i=0;i<nums.size();i++)

   {

       if(count1[nums[i]]==1&&flag==0)

    {

        cout<<nums[i];

        flag=1;

    }

   }

   if(flag==0)

    cout<<"None";

   return 0;

}