Codeforces Round #379 (Div. 2)-C. Anton and Making Potions

原题链接

C. Anton and Making Potions

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Anton is playing a very interesting computer game, but now he is stuck at one of the levels. To pass to the next level he has to prepare npotions.

Anton has a special kettle, that can prepare one potions in x seconds. Also, he knows spells of two types that can faster the process of preparing potions.

1. Spells of this type speed up the preparation time of one potion. There are m spells of this type, the i-th of them costs bi manapoints and changes the preparation time of each potion to ai instead of x.
2. Spells of this type immediately prepare some number of potions. There are k such spells, the i-th of them costs di manapoints and instantly create ci potions.

Anton can use no more than one spell of the first type and no more than one spell of the second type, and the total number of manapoints spent should not exceed s. Consider that all spells are used instantly and right before Anton starts to prepare potions.

Anton wants to get to the next level as fast as possible, so he is interested in the minimum number of time he needs to spent in order to prepare at least n potions.

Input

The first line of the input contains three integers n, m, k (1 ≤ n ≤ 2·109, 1 ≤ m, k ≤ 2·105) — the number of potions, Anton has to make, the number of spells of the first type and the number of spells of the second type.

The second line of the input contains two integers x and s (2 ≤ x ≤ 2·109, 1 ≤ s ≤ 2·109) — the initial number of seconds required to prepare one potion and the number of manapoints Anton can use.

The third line contains m integers ai (1 ≤ ai < x) — the number of seconds it will take to prepare one potion if the i-th spell of the first type is used.

The fourth line contains m integers bi (1 ≤ bi ≤ 2·109) — the number of manapoints to use the i-th spell of the first type.

There are k integers ci (1 ≤ ci ≤ n) in the fifth line — the number of potions that will be immediately created if the i-th spell of the second type is used. It's guaranteed that ci are not decreasing, i.e. ci ≤ cj if i < j.

The sixth line contains k integers di (1 ≤ di ≤ 2·109) — the number of manapoints required to use the i-th spell of the second type. It's guaranteed that di are not decreasing, i.e. di ≤ dj if i < j.

Output

Print one integer — the minimum time one has to spent in order to prepare n potions.

Examples

input

20 3 2
10 99
2 4 3
20 10 40
4 15
10 80

output

20

input

20 3 2
10 99
2 4 3
200 100 400
4 15
100 800

output

200

遍历第一个type的每个spell,选择该spell,更新钱数，再用二分找到在现有钱数范围之内，第二种type的最大potions,算出时间更新答案

#include <bits/stdc++.h>
#define maxn 200005
#define MOD 1000000007
typedef long long ll;
using namespace std;

ll p1[2][maxn], p2[2][maxn];
int main(){
//	freopen("in.txt", "r", stdin);
	ll n, m, k, x, s;
	scanf("%I64d%I64d%I64d", &n, &m, &k);
	scanf("%I64d%I64d", &x, &s);
	for(int i = 1; i <= m; i++)
	 scanf("%I64d", &p1[0][i]);
	for(int i = 1; i <= m; i++)
	 scanf("%I64d", &p1[1][i]);
	for(int i = 1; i <= k; i++)
	 scanf("%I64d", &p2[0][i]);
	for(int i = 1; i <= k; i++)
	 scanf("%I64d", &p2[1][i]);
	 
	ll mins = -1;
	p1[0][0] = x;
	for(int i = 0; i <= m; i++){
		
		if(s < p1[1][i])
		 continue;
		ll v = n;
		ll d = s - p1[1][i];
		ll ans = 0;
		int d2 = upper_bound(p2[1], p2[1] + k+1, d) - p2[1];
		d2--;
		if(p2[0][d2] < v){
			v -= p2[0][d2];
			ans += v * p1[0][i];
		}
		if(mins == -1)
		 mins = ans;
		else
		 mins = min(ans, mins);
	}
	printf("%I64d\n", mins);
	return 0;
}