标签：
| Time Limit: 2000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
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 109.
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 a1,?a2,?...,?an (1?≤?ai?≤?109), where ai 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 b1,?b2,?...,?bm (1?≤?bj?≤?109), where bj is the index of the audio language of the j-th movie.
The fifth line contains m positive integers c1,?c2,?...,?cm (1?≤?cj?≤?109), where cj 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 bj?≠?cj.
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
3 2 3 2 2 3 2 2 3
2
6 6 3 1 1 3 7 5 1 2 3 4 5 2 3 4 5 1
1
Source
#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;
}Codeforces--670C--Cinema（STL map）
标签：
原文地址：http://blog.csdn.net/qq_29963431/article/details/51362555
