Codeforce#379C. Anton and Making Potions(二分or贪心)

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 80 manapoints. The total number of manapoints used is 10 + 80 = 90, and the preparation time is 4·5 = 20 seconds (15potions 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.

题意：要求得到至少n个药剂，可以使用两种魔法，一种能够缩短制药时间，一种能瞬间制药，

给你x表示标准制药一个要x秒，给你s表示你的法力值为s

m种第一类类魔法，消耗b点魔法，缩短时间为a秒。

k种第二类魔法，消耗d点魔法，瞬间做出c个药。

两种魔法最多各选一个用，问你最少花多少时间能制得至少n个药剂

分析：当时做的时候看着数据量好像有点大，所以就想把第一种药剂给筛选一下。首先按第一种药剂能够缩减到的时间从小到大排个序，如果缩减时间相同就按花费（耗魔力值）递增排序。你想阿，肯定得选那些能够缩减到的时间越小的，而且花费也 小的。如果能够缩减到的时间大而且花费也大，要它干嘛用呢，扔了。这样就对第一种药剂筛选了下。第二种药剂花费和降低的point都是递增的。所以两个for，或者一个for加一个二分也行。当时想着先拿两个for写写吧，因为大半夜了。其实两个for也能过。

还有一种做法就是不用筛选第一种药剂，直接一个for加一个二分也行。

经历：第三个测试点过不了很懵逼，当时完全不知道错在哪。因为我考虑过只用一种药剂或者不用任何一种药剂的情况。在两个for之前有过一些处理。其实最可恨的就是没有把只用第一种药剂的第一个药算上！

两个for的代码如下：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 200005;
struct Node
{
    long long time, cost;
}fir[maxn], fi[maxn];
struct node
{
    long long rud, cost;
}sen[maxn];
bool cmp(Node p, Node q)
{
    if(p.time == q.time)
        return p.cost < q.cost;
    else
        return p.time < q.time;
}
bool cmp2(Node p, Node q)
{
    if(p.cost == q.cost)
        return p.time > q.time;
    else
        return p.cost < q.cost;
}
int main()
{
    long long n, m, k, x, s;
    while(scanf("%I64d%I64d%I64d", &n, &m, &k) != EOF)
    {
        scanf("%I64d%I64d" , &x, &s);
        for(int i = 0; i < m; i++)
            scanf("%I64d", &fir[i].time);
        for(int i = 0; i < m; i++)
            scanf("%I64d", &fir[i].cost);
        for(int i = 0; i < k; i++)
            scanf("%I64d", &sen[i].rud);
        for(int i = 0; i < k; i++)
            scanf("%I64d", &sen[i].cost);
        long long ans  = n * x;
        sort(fir, fir + m, cmp);
        long long pre = fir[0].time, cost = fir[0].cost, cou = 1;
        fi[0].time = pre, fi[0].cost = cost;
        if(cost <=s && pre * n < ans)       //当时就是错在这！
            ans = pre * n;
        for(int i = 1; i < m; i++)
        {
            if(fir[i].time == pre)
                continue;
            else if(cost > fir[i].cost)
            {
                pre = fir[i].time;
                cost = fir[i].cost;
                fi[cou].time = pre;
                fi[cou].cost = cost;
                cou++;
                if(cost <= s && n*pre < ans)
                {
                    ans = n * pre;
                }
            }
        }
        sort(fi, fi + cou, cmp2);
        long long ts, point;
        for(int i = 0; i < k; i++)
        {
            if(sen[i].cost > s)
                break;
            ts = s - sen[i].cost;
            point = n - sen[i].rud;
            if(point * x < ans)
                ans = point * x;
            for(int j = 0; j < cou; j++)
            {
                if(ts < fi[j].cost)
                    break;
                long long t = point * fi[j].time;
                if(t < ans)
                    ans = t;
            }
        }
        printf("%I64d\n", ans);
    }
    return 0;
}