1037

最新推荐文章于 2022-06-25 02:36:41 发布

比锅

最新推荐文章于 2022-06-25 02:36:41 发布

阅读量238

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/czh1075208140/article/details/79866560

版权

PAT 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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 N times 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 NC, followed by a line with NC coupon integers. Then the next line contains the number of products NP, followed by a line with NP product values. Here 1<= NC, NP <= 105, and it is guaranteed that all the numbers will not exceed 230.

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:

#include <iostream>
#include <algorithm>

using namespace std;

bool cmp(int a, int b)
{
    return a>b;
}

int coupon[100005];
int product[100005];

int main()
{
    int nc,np,total=0;
    scanf("%d", &nc);
    for(int i=0;i<nc;i++)
        cin >> coupon[i];
    scanf("%d", &np);
    for(int i=0;i<np;i++)
        cin >> product[i];

    sort(coupon,coupon+nc,cmp);
    sort(product,product+np,cmp);

    int i=0,j=0;
    while(coupon[i]>0 && product[j]>0 && i<nc && j<np)
    {
        total += coupon[i] * product[j];
        i++;
        j++;
    }
    int index1 = nc-1;
    int index2 = np-1;
    while(coupon[index1]<0 && product[index2]<0 &&index1>=0 && index2>=0)
    {
        total += coupon[index1] * product[index2];
        index1--;
        index2--;
    }
    cout << total;
    return 0;
}