CodeForces - 670C Cinema (map&模拟)水
来源:互联网 发布:java中getField 编辑:程序博客网 时间:2024/06/06 05:54
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 from1 to 109.
In the evening after the conference, all n scientists decided to go to the cinema. There arem movies in the cinema they came to. Each of the movies is characterized by twodistinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie, will bevery pleased if he knows the audio language of the movie, will bealmost satisfied if he knows the language of subtitles and will benot 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 integersa1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the index of a language, which thei-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 integersb1, b2, ..., bm (1 ≤ bj ≤ 109), where bj is the index of the audio language of thej-th movie.
The fifth line contains m positive integersc1, c2, ..., cm (1 ≤ cj ≤ 109), where cj is the index of subtitles language of thej-th movie.
It is guaranteed that audio languages and subtitles language are different for each movie, that isbj ≠ 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
32 3 223 22 3
2
66 3 1 1 3 751 2 3 4 52 3 4 5 1
1
Sample Output
Hint
Source
#include<stdio.h>#include<string.h>#include<algorithm>#include<map>#define N 200010using namespace std;map<int,int>s;int a[N];int b[N];struct zz{int a;int b;}p[N];int main(){int n,m,i,j,k;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&a[i]);s[a[i]]++;}scanf("%d",&m);for(i=1;i<=m;i++)scanf("%d",&p[i].a);for(i=1;i<=m;i++)scanf("%d",&p[i].b);int mm=0;k=1;for(i=1;i<=m;i++){if(mm<s[p[i].a]){mm=s[p[i].a];k=i;}}int kk=0;for(i=1;i<=m;i++){if(s[p[i].a]==mm){if(kk<s[p[i].b]){kk=s[p[i].b];k=i;}}}printf("%d\n",k);return 0;}
- CodeForces - 670C Cinema (map&模拟)水
- Codeforces--670C--Cinema(STL map)
- codeforces 670C Cinema
- codeforces 670C Cinema
- codeforces 670C Cinema
- CodeForces 670C Cinema
- codeforces 670C Cinema
- codeforces 670C Cinema
- CodeForces 349A Cinema Line (模拟)
- CodeForces 670C Cinema(排序,离散化)
- CodeForces - 659C Tanya and Toys (map&模拟)
- Codeforces Round #350 (Div. 2) C Cinema
- Codeforces Round #350 (Div. 2) C. Cinema
- Codeforces Round 380 C. Road to Cinema
- 【Codeforces 729 C Road to Cinema】 + 二分
- Codeforces(738C)-Road to Cinema
- CodeForces 729C Road to Cinema 二分
- Cinema CodeForces
- 回溯法实现格雷码
- Java数组操作
- 交叉验证(Cross-Validation)
- STL 浅入 容器 (一)
- java 异常三
- CodeForces - 670C Cinema (map&模拟)水
- Js倒计时
- Maven学习7之生命周期管理
- Spring自带字符编码过滤器
- HUST 1010 (KMP 水~)
- Go语言学习(十二)面向对象编程-结构体
- 欢迎使用CSDN-markdown编辑器
- 学习篇---TreeView的实现
- C++作业5