POJ 3784 Running Median (模拟水过带翻译)

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

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 10

1 7

3 6

6 10

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.

Analysis

一句话题意：给你多组数据每组数据先是一个编号再是数据个数，要你在输入奇数个数据时把已输入数据的中卫数输出，输出10个数换一行

输出前先输出数据编号和有几个输出(不就(n+1)/2么)

这题网上说用单调队列或者大跟堆小根堆一起用？？？？？？

what这么复杂？？？？？？于是我决定自己写insert函数然后就AC了。。。

代码

真的很水啦。。。

#include<iostream>
#include<cstdlib>
#include<algorithm>
using namespace std;
int t,n,a[10000];
void insert(int k,int l){
	while(k>a[l-1]&&l>1){
		a[l]=a[l-1];
		--l;
	}
	a[l]=k;
}
int main(){
freopen("out.txt","w",stdout);
	cin>>t;
	while(t--){
		int ji=0;
		cin>>n;cout<<n<<" ";
		cin>>n;cout<<(n+1)/2<<endl;
		int co=0;
		for(int i=1;i<=n;i++){
			cin>>co;
			insert(co,i);
			if(i%2){
				if(ji==10){cout<<endl;ji=0;}
				cout<<a[(i+1)/2]<<" ";
				++ji;
			}
		}
		cout<<endl;
	}
}
}