8.21 PAT 甲级 1037 Magic Coupon

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 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<iostream>
#include<algorithm>

using namespace std;

const int N = 100010;

int az[N], af[N], bz[N], bf[N], nc, np, res;

bool cmp(int a, int b)
{
    return a > b;
}
int main()
{
    cin >> nc;
    
    //z1表示优惠券中正数的数量，f1表示优惠券中负数的数量
    int z1 = 0, f1 = 0, z2 = 0, f2 = 0;
    for(int i = 0; i < nc; i ++ )
    {
        int k;
        cin >> k;
        if(k > 0)   az[z1 ++] = k;
        if(k < 0)   af[f1 ++] = k;
    }
    
    cin >> np;
    
    for(int i = 0; i < np; i ++ )
    {
        int k;
        cin >> k;
        if(k > 0)   bz[z2 ++] = k;
        if(k < 0)   bf[f2 ++] = k;
    }
    
    
    sort(az, az + z1, cmp);
    sort(bz, bz + z2, cmp);
    sort(af, af + f1);
    sort(bf, bf + f2);
    
    if(z1 > z2) swap(z1, z2);
    if(f1 > f2) swap(f1, f2);
    
    
    for(int i = 0; i < z1; i ++ )
        res += az[i] * bz[i];
    //cout << res << endl;
    for(int i = 0; i < f1; i ++ )
        res += af[i] * bf[i];
    //cout << az[0] << ' ' << bf[0] << endl;
    cout << res << endl;
    
}