T-shirt buying（set顺序查找）

题目链接：http://codeforces.com/problemset/problem/799/B

B. T-shirt buying

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A new pack of n t-shirts came to a shop. Each of the t-shirts is characterized by three integers pi, ai and bi, where pi is the price of the i-th t-shirt, ai is front color of the i-th t-shirt and bi is back color of the i-th t-shirt. All values pi are distinct, and values ai and bi are integers from 1 to 3.

m buyers will come to the shop. Each of them wants to buy exactly one t-shirt. For the j-th buyer we know his favorite color cj.

A buyer agrees to buy a t-shirt, if at least one side (front or back) is painted in his favorite color. Among all t-shirts that have colors acceptable to this buyer he will choose the cheapest one. If there are no such t-shirts, the buyer won't buy anything. Assume that the buyers come one by one, and each buyer is served only after the previous one is served.

You are to compute the prices each buyer will pay for t-shirts.

Input

The first line contains single integer n (1 ≤ n ≤ 200 000) — the number of t-shirts.

The following line contains sequence of integers p1, p2, ..., pn (1 ≤ pi ≤ 1 000 000 000), where pi equals to the price of the i-th t-shirt.

The following line contains sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 3), where ai equals to the front color of the i-th t-shirt.

The following line contains sequence of integers b1, b2, ..., bn (1 ≤ bi ≤ 3), where bi equals to the back color of the i-th t-shirt.

The next line contains single integer m (1 ≤ m ≤ 200 000) — the number of buyers.

The following line contains sequence c1, c2, ..., cm (1 ≤ cj ≤ 3), where cj equals to the favorite color of the j-th buyer. The buyers will come to the shop in the order they are given in the input. Each buyer is served only after the previous one is served.

Output

Print to the first line m integers — the j-th integer should be equal to the price of the t-shirt which the j-th buyer will buy. If the j-th buyer won't buy anything, print -1.

Examples

input

Copy

5
300 200 400 500 911
1 2 1 2 3
2 1 3 2 1
6
2 3 1 2 1 1

output

Copy

200 400 300 500 911 -1 

input

Copy

2
1000000000 1
1 1
1 2
2
2 1

output

Copy

1 1000000000 

ac：

#include<stdio.h>
#include<string.h>
#include<math.h>

//#include<map>
#include<set>
#include<deque>
#include<queue>
#include<stack>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;

#define ll long long
#define da    0x3f3f3f3f
#define xiao -0x3f3f3f3f
#define clean(a,b) memset(a,b,sizeof(a))// 雷打不动的头文件

int piace[201000];//价格 
int order[201000];//储存结果 

struct judge{		//自定义排序 
	int data;// 数据 
	bool operator()(const int a,const int b){//排序 
		return a<b;
	}
};

set<int,judge> front[5];//不重复的集合 
set<int,judge>::iterator it;
int n;

int main()
{
	cin>>n;
	int i,j;
	for(i=1;i<=n;++i)
		cin>>piace[i];
	for(i=1;i<=n;++i)
	{
		int color;
		cin>>color;
		front[color].insert(piace[i]);
	}
	for(i=1;i<=n;++i)
	{
		int color;
		cin>>color;
		front[color].insert(piace[i]);
	}
	int m;
	cin>>m;
	int k=0;
	for(i=0;i<m;++i)
	{
		int color;
		cin>>color;
		if(front[color].size()==0)
			order[k++]=-1;
		else
		{
			it=front[color].begin();
			int p=*it;
			order[k++]=p;
			for(j=1;j<=3;++j)
			{
				if(front[j].find(p)!=front[j].end())
					front[j].erase(p);
			}
		}
	}
	cout<<order[0];
	for(i=1;i<k;++i)
		cout<<" "<<order[i];
	cout<<endl;
}