1037 Magic Coupon (25 point(s))

1037 Magic Coupon (25 point(s))

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

贪心策略。

贪心证明：对于同号的数组，显然两个相对大的整数乘积加上两个相对小的整数乘积得到的和更大。

思路

先分别排序（从小到大）。

然后从两个序列尾部开始，将正数和正数的乘积加到结果ans中；然后从两个序列的头部开始，将负数和负数的乘积加到ans中。

需要注意的是，没有要求要把coupon或者product用完，所以忽略正数和负数相乘的。

#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int main(void){
	int nc,np;
	cin>>nc;ll *c = new ll[nc];
	for(int i=0;i<nc;i++) cin>>c[i];
	cin>>np;ll *p = new ll[np];
	for(int i=0;i<np;i++) cin>>p[i];
	sort(c,c+nc);
	sort(p,p+np);
	ll ans = 0;
	for(int i=nc-1,j=np-1;i>=0&&j>=0;i--,j--){
		if(c[i]>0&&p[j]>0) ans+=c[i]*p[j];
		else break;
	} 
	for(int i=0,j=0;i<nc&&j<np;i++,j++){
		if(c[i]<0&&p[j]<0) ans+=c[i]*p[j];
	}
	cout<<ans<<endl;
	return 0;
}