Cinema CodeForces - 670C （离散+排序）

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 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 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.

Examples

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

Note

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.

题意：有n个科学家，每个人都会一种语言，用整数a【i】表示，m部电影，每个电影用b【i】语言配音，用c【i】语言填字幕，

求一个电影，他被最多的人听懂，如果有多种方案，求此情况下，被最多人看懂的（a【i】 == c【i】就可以看懂）。

思路: 我们可以想到，把科学家会的语言计数，然后对电影先按b【i】数量后按c【i】数量排序。

计数的话，我们肯定要离散化，因为 0 <= i <= 2e5

1、我们可以用map，但是注意这题是卡了unordered_map的，直接用map或者hash_map都行

 include<bits/stdc++.h>
 using namespace std;

 int n,m;
 const int maxn = 2e5+;
 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 = ;
     for(int i=; i<=n; i++)
     {
         scanf("%d",&tmp);
         if(!mp[tmp])
         {
             mp[tmp] = ++cnt;
             sc[cnt]++;
         }
         else
             sc[mp[tmp]]++;
     }
     scanf("%d",&m);
     for(int i=; i<=m; i++)
         scanf("%d",&tmp),mov[i].id = i,mov[i].b = sc[mp[tmp]];
     for(int i=; i<=m; i++)
         scanf("%d",&tmp),mov[i].c = sc[mp[tmp]];
     sort(mov+,mov++m,cmp);
     printf("%d\n",mov[].id);
 }

2、我们可以用二分离散，就是先排序a【i】，然后用unique或者手写去重，用二分查找a【i】在去重后的哪个位置，得出离散后的结果

这样我们在求取b【i】数量（或c【i】）的时候，也是二分查找b【i】（或c【i】）在去重后的位置，但是的出来位置上的电影编号不一定等于b【i】（或c【i】），

如果相等那么b【i】 = sc【pos】 （sc是之前科学家语言的计数），如果不等，b【i】 = 0（说明科学家中没人懂这语言）；

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 using namespace std;

 int n,m;
 const int maxn = 2e5+;
 int a[maxn];
 int b[maxn];
 int sc[maxn];

 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 query(int x,int len)
 {
     return lower_bound(b+,b++len,x)-b;
 }
 int main()
 {
     scanf("%d",&n);
     for(int i=; i<=n; i++)scanf("%d",&a[i]);
     sort(a+,a++n);
     int tmp;
     int len = ;
     for(int i=;i<=n;i++)
     {
         if(i== || a[i] != a[i-])
             b[++len] = a[i];
     }

     for(int i=;i<=n;i++)
     {
         tmp = query(a[i],len);
         sc[tmp]++;
     }
     scanf("%d",&m);
     for(int i=; i<=m; i++)
     {
         scanf("%d",&tmp),mov[i].id = i;
         int pos  = query(tmp,len);
         if(b[pos] == tmp)mov[i].b = sc[pos];
         else mov[i].b = ;
     }
     for(int i=; i<=m; i++)
     {
         scanf("%d",&tmp);
         int pos = query(tmp,len);
         if(b[pos] == tmp)mov[i].c = sc[pos];
         else mov[i].c = ;
     }
     sort(mov+,mov++m,cmp);
     printf("%d\n",mov[].id);
 }