PAT (Advanced Level) 1037 Magic Coupon （25 分）

1037 Magic Coupon （25 分）

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​³⁰​​.

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

Code:

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
	vector<int> coupons_p,coupons_n, product_p, product_n;
	int nc, np;
	cin >> nc;
	for (int i = 0; i < nc; i++)
	{
		int temp;
		cin >> temp;
		(temp>0 ? coupons_p.push_back(temp): coupons_n.push_back(temp));
	}
	cin >> np;
	for (int i = 0; i < np; i++)
	{
		int temp;
		cin >> temp;
		(temp > 0 ? product_p.push_back(temp) : product_n.push_back(temp));
	}
	auto cmp = [](const int x, const int y)->bool {
		return fabs(x) > fabs(y); };
	sort(coupons_p.begin(), coupons_p.end(), cmp);
	sort(product_p.begin(), product_p.end(), cmp);
	sort(coupons_n.begin(), coupons_n.end());
	sort(product_n.begin(), product_n.end());
	auto sumUp = [](vector<int> c, vector<int> p) -> int {
		int sum = 0;
		for (int i = 0; i < c.size() && i < p.size(); i++)
			sum += c[i] * p[i];
		return sum;
	};
	cout << sumUp(coupons_p, product_p) + sumUp(coupons_n, product_n) << endl;
	return 0;
}