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 distinct numbers — 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 be almost 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.
OutputPrint 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.
Examples3
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
In the first sample, scientists must go to the movie with the index 2, as in such case the 1-th and the 3-rd scientists will be very pleased and the 2-nd scientist will be almost satisfied.
In the second test case scientists can go either to the movie with the index 1 or the index 3. After viewing any of these movies exactly two scientists will be very pleased and all the others will be not satisfied.
OJ-ID：
CodeForces-670C
author：
Caution_X
date of submission：
20191118
tags：
离散化
description modelling：
有n个人看电影，用输入数字[1,1e9]来表示每个人会的语言，有m场电影，标号分别是1到m，每场电影后有两个数字，表示这场电影的语音是语言b[i]，字幕是语言c[i]，现在选择一场电影，输出标号，要求这场电影能够使得最多的人听懂语言，在听懂语言的前提下要求看懂字幕的人最多。
major steps to solve it：
（1）离散化输入的代表语言的数字并记录各种语言都有多少人会
（2）对每一场电影进行处理，将该场电影对应的语言标号和字母标号替换成对应的会的人数
（3）根据题意对结构体进行排序，输出答案
AC code:[Code From : https://www.cnblogs.com/iwannabe/p/10164008.html]
#includeusing namespace std; int n,m; const int maxn = 2e5+5; int sc[maxn]; map<int,int>mp; struct Mo { int b; int c; int id; } mov[maxn]; bool cmp(Mo a,Mo b) { if(a.b == b.b) return a.c > b.c; return a.b > b.b; } int main() { scanf("%d",&n); int tmp; int cnt = 0; for(int i=1; i<=n; i++) { scanf("%d",&tmp); if(!mp[tmp]) { mp[tmp] = ++cnt; sc[cnt]++; } else sc[mp[tmp]]++; } scanf("%d",&m); for(int i=1; i<=m; i++) scanf("%d",&tmp),mov[i].id = i,mov[i].b = sc[mp[tmp]]; for(int i=1; i<=m; i++) scanf("%d",&tmp),mov[i].c = sc[mp[tmp]]; sort(mov+1,mov+1+m,cmp); printf("%d\n",mov[1].id); }