Codeforces 734C 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

Note

In the first sample, the optimum answer is to use the second spell of the first type that costs 10 manapoints. Thus, the preparation time of each potion changes to 4 seconds. Also, Anton should use the second spell of the second type to instantly prepare 15 potions spending 80manapoints. The total number of manapoints used is 10 + 80 = 90, and the preparation time is 4·5 = 20 seconds (15 potions were prepared instantly, and the remaining 5 will take 4 seconds each).

In the second sample, Anton can't use any of the spells, so he just prepares 20 potions, spending 10 seconds on each of them and the answer is 20·10 = 200.

题意：有一个瓶子每生成一滴药水需要x分钟，有两种加速生产药水的方式。 第一种有m个方案，第i个方案消耗bi个法力值，将每滴要药水的生成时间有x替换到ai 。 第二种有k个方案，第i个方案消耗di个法力值，直接不花费时间生成ci滴药水。 两种方式都只能选择一个方案或者不选择，且要求总消耗的法力值不超过s，问生产n滴药水最少需要多长时间？

题解：先写了一发双指针，悲惨的fst了。 最气的是还找不出来哪儿写错了。 换成二分法写，错了好几发。

题中说了第二种方式的方案ci,di都以递增的形式给出来，那么我们直接遍历，然后二分出满足条件的最大ci就行了。

代码如下：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 2e5+10;
#define LL long long
LL a[maxn],b[maxn],c[maxn],d[maxn]; 
int main()
{
	LL n,m,k,x,s;
	while(scanf("%lld%lld%lld",&n,&m,&k)!=EOF)
	{
		scanf("%lld%lld",&x,&s);
		for(int i=0;i<m;++i)
			scanf("%lld",&a[i]);
		for(int i=0;i<m;++i)
			scanf("%lld",&b[i]);
		for(int i=1;i<=k;++i)
			scanf("%lld",&c[i]);
		for(int i=1;i<=k;++i)
			scanf("%lld",&d[i]);
		LL ans =(n - c[upper_bound(d+1,d+k+1,s)-d-1]) * x; //数组下标从1开始，避免数组下标可能为-1 
		for(int i=0;i<m;++i)
		{
			if(b[i]>s)
				continue;
			ans = min(ans, (n - c[upper_bound(d+1,d+k+1,s-b[i])-d-1]) * a[i]); 
		} 
		printf("%lld\n",ans);
	}
	return 0;
}