CodeForces 526A-Voting for Photos【模拟】

今天药忘吃喽~ 2022-08-21 04:41 2阅读 0赞

A. Voting for Photos

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 1 000 000), where *a**i* is the identifier of the photo which got the *i*\-th like.

Output

Print the identifier of the photo which won the elections.

Examples

Input

5
    1 3 2 2 1

Output

Input

9
    100 200 300 200 100 300 300 100 200

Output

300

Note

In the first test sample the photo with id 1 got two likes (first and fifth), photo with id 2 got two likes (third and fourth), and photo with id 3 got one like (second).

Thus, the winner is the photo with identifier  2, as it got:

*  more likes than the photo with id 3;
 *  as many likes as the photo with id 1, but the photo with the identifier 2 got its second like earlier.
    
        #include<stdio.h>
        #include<queue>
        #include<algorithm>
        using namespace std;
        int map[1200];
        int map1[1200];
        //int wc[10000100];
        struct node
        {
        	int x;
        	int c;
        }num[1200];
        struct node1
        {
        	int x;
        	int c;
        }num1[1200];
        int nn;
        int lon,lon1;
        int find(int xx)
        {
        	int i,j=0;
        	for(i=0;i<lon;i++)
        	{
        		if(xx==num1[i].x)
        		{
        			j=1;
        			num1[i].c++;
        			return num1[i].c;
        		}
        	}
        	if(j==0)
        	{
        		num1[lon].x=xx;
        		num1[lon].c++;
        		lon++;
        		return num1[lon-1].c;
        	}
        }
        void findx(int xx)
        {
        	int i,j=0;
        	for(i=0;i<lon;i++)
        	{
        		if(xx==num[i].x)
        		{
        			j=1;
        			num[i].c++;
        		}
        	}
        	if(j==0)
        	{
        		num[lon].x=xx;
        		num[lon].c++;
        		lon++;
        	}
        }
        bool cmp(node x,node y)
        {
        	return x.c>y.c;
        }
        int main()
        {
        	
        	scanf("%d",&nn);
        	int i,j;
        	for(i=0;i<nn;i++)
        	{
        		scanf("%d",&map[i]);
        		map1[i]=map[i];
        	}
        	lon=0;
        	for(i=0;i<nn;i++)
        	{
        		findx(map[i]);
        	}
        	int ji=-1;
        	for(i=0;i<lon;i++)
        	{
        		if(ji<num[i].c)
        		ji=num[i].c;
        	}
        	int ans;
        	for(i=0;i<nn;i++)
        	{
        		int oo=find(map[i]);
        		if(ji==oo)
        		{
        			ans=map[i];
        			break;
        		}
        	}
        	printf("%d\n",ans);
        	return 0;
        }