PAT.A1037. 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 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 <= 10⁵, 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

水题，注意数组开到MAIN函数外面，防止STACK溢出。

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
using namespace std;
bool cmp(int a, int b) {
	return a > b;
}
int n1, n2, a1[100010], a2[100010], a4[100010], a3[100010];
int main(){
	int p1 = 0, p2 = 0, p3 = 0, p4 = 0;
	long long sum = 0;
	scanf("%d", &n1);
	for (int i = 0; i < n1; i++) {
		int temp;
		scanf("%d", &temp);
		if (temp > 0) a1[p1++]=temp;
		else a2[p2++] = temp;
	}
	scanf("%d", &n2);
	for (int i = 0; i < n2; i++) {
		int temp;
		scanf("%d", &temp);
		if (temp > 0) a3[p3++] = temp;
		else a4[p4++] = temp;
	}
	sort(a1, a1 + p1, cmp);
	sort(a2, a2 + p2);
	sort(a3, a3 + p3, cmp);
	sort(a4, a4 + p4);
	for (int i = 0; i < p1 && i < p3; i++) {
		sum += a1[i] * a3[i];
	}
	for (int i = 0; i < p2 && i < p4; i++) {
		sum += a2[i] * a4[i];
	}
	printf("%lld", sum);
		return 0;
	
}