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 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

这一题也不难，就是基于贪心算法的，如果coupon是正数，product也是正数，那么就取最大的c和最大的p，这样直到有一个不再有正数的。

接下来如果二者都有负的，负负得正，也是可以换到钱的，也是贪心算法，取二者最小的负数相乘，直到coupon没有或product没有或者二者一个全为正一个全为负。

题目要求的是如果达到最大值可以停手，而不必把coupon全花光，因此剩下的就不需要考虑怎么花coupon导致减去的最少。

代码如下：因为一开始一位需要把coupon全花光，所以代码写的麻烦了点

#include <stdio.h>
#include <stdlib.h>

#define PRINT_I(x) printf("%s = %d\n",#x,x);
#define PRINT_F(x) printf("%s = %f\n",#x,x);
#define PRINT_S(x) printf("%s = %s\n",#x,x);

int cmp(const void *a,const void *b);

int main(int argc,char* argv[])
{
	int i,nc,np,money,num;
	int *c,*p;
	int p_c,z_c,n_c;
	int p_p,z_p,n_p;

	//freopen("input","r",stdin);

	scanf("%d",&nc);
	c = (int *)malloc(sizeof(int)*nc);
	for (i = 0; i < nc; ++i)
		scanf("%d",&c[i]);

	scanf("%d",&np);
	p = (int *)malloc(sizeof(int)*np);
	for (i = 0; i < np; ++i)
		scanf("%d",&p[i]);

	qsort(c,nc,sizeof(int),cmp);
	qsort(p,np,sizeof(int),cmp);

	i = 0;
	while(c[i] < 0) i++;
	n_c = i;
	while(c[i] == 0) i++;
	z_c = i - n_c;
	p_c = nc - n_c - z_c;

	i = 0;
	while(p[i] < 0) i++;
	n_p = i;
	while(p[i] == 0) i++;
	z_p = i - n_p;
	p_p = np - n_p - z_p;

	money = 0;
	num = (p_c < p_p) ? p_c : p_p;
	for (i = 0; i < num; ++i)
		money += c[nc-1-i] * p[np-1-i];

	num = (n_c < n_p) ? n_c : n_p;

	for(i = 0; i < num; ++i)
		money += c[i] * p[i];

	printf("%d\n", money);

	free(p);
	free(c);
	return 0;
}

int cmp(const void *a,const void *b)
{
	return *(int *)a - *(int *)b;
}