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

解题思路：
将两个集合进行从大到小的排序，正数之间从左边开始对应相乘，负数之间从右边开始对应相乘。

代码如下：

#include<stdio.h>
#include<vector>
#include<math.h>
#include<algorithm>
#include<iostream>
using namespace std;

vector<long long> a, b;

int cmp(long long a, long long b) {
		return a > b;
}

int main() {
	int Nc, Np;
	long long x;
	cin >> Nc;
	for (int i = 0; i < Nc; i++) {
		scanf("%lld",&x);
		a.push_back(x);
	}
	cin >> Np;
	for (int i = 0; i < Np; i++) {
		scanf("%lld", &x);
		b.push_back(x);
	}
	sort(a.begin(), a.end(),cmp);
	sort(b.begin(), b.end(),cmp);
	long long count = 0;
	int k=0;
	while (k<a.size()&&k<b.size()&&a[k]>0&&b[k]>0) {
		count += a[k] * b[k];
		k++;
	}
	int i = a.size()-1, j = b.size() - 1;
	while (a[i]<0&&b[j]<0) {
		count += a[i] * b[j];
		i--;
		j--;
	}
	cout << count;
}