Codeforces--670C--Cinema（STL map）



Cinema

Submit Status

Description

Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists knows exactly one language.
For convenience, we enumerate all languages of the world with integers from 1 to 10⁹.

In the evening after the conference, all n scientists decided to go to the cinema. There are m movies
in the cinema they came to. Each of the movies is characterized by two distinctnumbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie, will be very
pleased if he knows the audio language of the movie, will bealmost satisfied if he knows the language of subtitles and will be not satisfied if
he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are always different).

Scientists decided to go together to the same movie. You have to help them choose the movie, such that the number of very pleased scientists is maximum possible. If there are several such movies, select among them one that will maximize the number of almost
satisfied scientists.

Input

The first line of the input contains a positive integer n (1?≤?n?≤?200?000) — the number of scientists.

The second line contains n positive integers a₁,?a₂,?...,?a_n (1?≤?a_i?≤?10⁹),
where a_i is the index of a language, which the i-th
scientist knows.

The third line contains a positive integer m (1?≤?m?≤?200?000) — the number of movies in the cinema.

The fourth line contains m positive integers b₁,?b₂,?...,?b_m (1?≤?b_j?≤?10⁹),
where b_j is the index of the audio language of the j-th
movie.

The fifth line contains m positive integers c₁,?c₂,?...,?c_m (1?≤?c_j?≤?10⁹),
where c_j is the index of subtitles language of the j-th
movie.

It is guaranteed that audio languages and subtitles language are different for each movie, that is b_j?≠?c_j.

Output

Print the single integer — the index of a movie to which scientists should go. After viewing this movie the number of very pleased scientists should be maximum possible. If in the cinema there are several such movies, you need to choose among them one, after
viewing which there will be the maximum possible number of almost satisfied scientists.

If there are several possible answers print any of them.

Sample Input

Input

3
2 3 2
2
3 2
2 3

Output

2

Input

6
6 3 1 1 3 7
5
1 2 3 4 5
2 3 4 5 1

Output

1

Source

Codeforces Round #350 (Div. 2)

题意：n个科学家去看电影，每个科学家会一种语言，现在有m种电影，每个电影都有对应的两种语言，一种背景，一种字幕，如果一个科学家可以听懂对应的背景语言，他会非常高兴，如果可以看懂字幕，他会比较高兴，如果什么都看不懂，他会很不高兴，现在要求非常高兴的人最多，其次是比较高兴的人也最多，输出对应的电影编号

#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
using namespace std;
map<int,int>fp;
int u[200010],v[200010];
int n;
int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		fp.clear();
		memset(u,0,sizeof(u));
		memset(v,0,sizeof(v));
		int x,a,b;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&x);
			fp[x]++;
		}
		int m,ans=0,f=1;
		scanf("%d",&m);
		for(int i=1;i<=m;i++)
		scanf("%d",&u[i]);
		for(int i=1;i<=m;i++)
		scanf("%d",&v[i]);
		for(int i=1;i<=m;i++)
		{
			if(fp[u[i]]>ans)
			{
				ans=fp[u[i]];
				f=i;
			}
		}
		int temp=0;
		for(int i=1;i<=m;i++)
		{
			if(fp[u[i]]==ans)
			{
				if(temp<fp[v[i]])
				{
					temp=fp[v[i]];
					f=i;
				}
			}
		}
		printf("%d\n",f);
	}
	return 0;
}