# Codeforces 734C. Anton and Making Potions (枚举 + 二分)

Description
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 n potions.

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.

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 b i manapoints and changes the preparation time of each potion to a i instead of x.
Spells of this type immediately prepare some number of potions. There are k such spells, the i-th of them costs d i manapoints and instantly create c i 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 a i (1 ≤ a i < 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 b i (1 ≤ b i ≤ 2·109) — the number of manapoints to use the i-th spell of the first type.

There are k integers c i (1 ≤ c i ≤ 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 c i are not decreasing, i.e. c i ≤ c j if i < j.

The sixth line contains k integers d i (1 ≤ d i ≤ 2·109) — the number of manapoints required to use the i-th spell of the second type. It’s guaranteed that d i are not decreasing, i.e. d i ≤ d j 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

Solution

Code

const int maxn = 4e5 + 7;
int a[maxn],b[maxn];
int c[maxn],d[maxn];
int main() {
int n,m,k;scanf("%d%d%d",&n,&m,&k);
int x,s;scanf("%d%d",&x,&s);
for(int i = 1;i <= m;++i){
scanf("%d",&a[i]);
}
for(int i = 1;i <= m;++i){
scanf("%d",&b[i]);
}
for(int i = 1;i <= k;++i){
scanf("%d",&c[i]);
}
for(int i = 1;i <= k;++i){
scanf("%d",&d[i]);
}

ll res = 0;
int pos = upper_bound(d + 1,d + 1 + k,s) - d - 1;
// debug2(s,pos);
if(pos != 0) res = 1ll*(n - c[pos]) * x;
else res = 1ll*n*x;
for(int i = 1;i <= m;++i){
pos = upper_bound(d + 1,d + 1 + k,s - b[i]) - d - 1;
if(pos != 0) res = min(res, 1ll*(n - c[pos]) * a[i]);
else if(b[i] <= s) res = min(res, 1ll * n * a[i]);
// debug2(s - b[i],pos);
}
printf("%lld\n", res);
return 0;
}


08-09 150