VK Cup 2016 - Qualification Round 1 (Russian-Speaking Only, for VK Cup teams) A. Voting for Photos 水题

A. Voting for Photos

题目连接：

http://www.codeforces.com/contest/637/problem/A

Description

After celebrating the midcourse the students of one of the faculties of the Berland State University decided to conduct a vote for the best photo. They published the photos in the social network and agreed on the rules to choose a winner: the photo which gets most likes wins. If multiple photoes get most likes, the winner is the photo that gets this number first.

Help guys determine the winner photo by the records of likes.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 1000) — the total likes to the published photoes.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 1 000 000), where ai is the identifier of the photo which got the i-th like.

Output

Print the identifier of the photo which won the elections.

Sample Input

5

1 3 2 2 1

Sample Output

2

Hint

题意

给你n个数，然后问你哪个数出现的次数最多，如果有多个数出现次数一样多，就输出第一个那么多次数的数。

题解：

开个map随便搞搞就好了……

代码

#include<bits/stdc++.h>
using namespace std;

map<int,int>H;

int main()
{
    int n;scanf("%d",&n);
    int ans1 = 0,ans2 = 0;
    for(int i=1;i<=n;i++)
    {
        int x;scanf("%d",&x);
        H[x]++;
        if(H[x]>ans2)ans1=x,ans2=H[x];
    }
    cout<<ans1<<endl;
}