1037 Magic Coupon (25 分)

版权声明:转载留名即可 ^_^ https://blog.csdn.net/qq_33375598/article/details/88358521

The magic shop in Mars is offering some magic coupons(优惠卷). Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N times the value of that product back! What is more, the shop also offers some bonus product for free. However, if you apply a coupon with a positive N to this bonus(红利、奖金) product, you will have to pay the shop Ntimes the value of the bonus product... but hey, magically, they have some coupons with negative N's!

For example, given a set of coupons { 1 2 4 −1 }, and a set of product values { 7 6 −2 −3 } (in Mars dollars M$) where a negative value corresponds to a bonus product. You can apply coupon 3 (with N being 4) to product 1 (with value M$7) to get M$28 back; coupon 2 to product 2 to get M$12 back; and coupon 4 to product 4 to get M$3 back. On the other hand, if you apply coupon 3 to product 4, you will have to pay M$12 to the shop.

Each coupon and each product may be selected at most once. Your task is to get as much money back as possible.

Input Specification:

Each input file contains one test case. For each case, the first line contains the number of coupons N​C​​, followed by a line with N​C​​ coupon integers. Then the next line contains the number of products N​P​​, followed by a line with N​P​​ product values. Here 1≤N​C​​,N​P​​≤10​5​​, and it is guaranteed that all the numbers will not exceed 2​30​​.

Output Specification:

For each test case, simply print in a line the maximum amount of money you can get back.

Sample Input:

4
1 2 4 -1
4
7 6 -2 -3

Sample Output:

43

参考代码:

#include<cstdio>
#include<algorithm>

using namespace std;

const int maxn = 2000000000;
double coupons[maxn];
double pd[100010];
long long res = 0;


int main(){
    int NC, NP;
    scanf("%d", &NC);
    for (int i = 0; i < NC; ++i) {
        scanf("%lf", &coupons[i]);
    }
    scanf("%d", &NP);
    for (int j = 0; j < NP; ++j) {
        scanf("%lf", &pd[j]);
    }
    sort(coupons, coupons + NC);
    sort(pd, pd + NP);

    int i = 0;
    while(i < NC && i < NP && coupons[i] < 0 && pd[i] < 0){
        res += coupons[i] * pd[i];
        i++;
    }
    i = NC - 1;
    int j = NP - 1;
    while(i >= 0 && j >= 0 && coupons[i] > 0 && pd[j] > 0){
        res += coupons[i] * pd[j];
        i--;
        j--;
    }
    printf("%lld\n", res);
    return 0;


}

 

没有更多推荐了,返回首页