PAT甲级—— 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.

 

输入描述:

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 <= 105, and it is guaranteed that all the numbers will not exceed 230.

 

输出描述:

For each test case, simply print in a line the maximum amount of money you can get back.

 

输入例子:

4
1 2 4 -1
4
7 6 -2 -3

 

输出例子:

43

思路：在接收两个数组数据的时候，分别统计两个数组中包含的正数和负数的个数。接收完数据之后对两个数组用sort进行排序，比较两个数组中的正数个数，取最小值b。同理，取负数个数的最小值c。这样，我们只需将排序后的两个数组中的前面b个负数对应相乘，并将结果加起来，再将两个数组后面的c个正数对应相乘，继续把结果相加就可以得到最后的输出结果。

#include <iostream>
#include<algorithm>
using namespace std;
const int maxn = 100010;

int min(int a, int b)
{
	if (a <= b) return a;
	else return b;
}
int main()
{
	int a1[maxn], b1=0,c1=0;
	int a2[maxn], b2=0,c2=0;
	int nc, np;
	scanf_s("%d", &nc);
	for (int i = 0; i < nc; i++)
	{
		scanf_s("%d", &a1[i]);
		if (a1[i] < 0) b1++;
		else c1++;
	}
	scanf_s("%d", &np);
	for (int i = 0; i < np; i++)
	{
		scanf_s("%d", &a2[i]);
		if (a2[i] < 0) b2++;
		else c2++;
	}
	sort(a1, a1 + nc);
	sort(a2, a2 + np);
	int ans = 0;
	for (int i = 0; i < min(b1, b2); i++)
	{
		ans += a1[i] * a2[i];
	}
	for (int i = 0; i < min(c1, c2); i++)
	{
		ans += a1[nc - i-1] * a2[np - i-1];//这里的减一不能掉，因为a1[np]和a2[nc]会越界
	}
	printf_s("%d", ans);
	return 0;
}