PAT 1037 Magic Coupon (25分) （贪心）

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 <bits/stdc++.h>
#define ll long long 
using namespace std;
int Nc, Np;
ll cs, ps;
vector<ll> cous;
vector<ll> pros;

int cmp(ll a, ll b) {
	return a > b;
}
int main(){
	ios::sync_with_stdio(false);
	cin >> Nc;
	for(int i = 0; i < Nc; i++){
		cin >> cs;
		cous.push_back(cs);
	}
	cin >> Np;
	for(int i = 0; i < Np; i++){
		cin >> ps;
		pros.push_back(ps);
	}
	sort(cous.begin(), cous.begin()+Nc);
	sort(pros.begin(), pros.begin()+Np);
	ll ans = 0;
	for(int i = 0; i < Nc && i < Np; i++){
		if(cous[i] < 0 && pros[i] < 0){
			ans += cous[i] * pros[i];
		} else break;
	}
	for(int i = Nc - 1, j = Np - 1; i >= 0 && j >= 0; i--, j--){
		if(cous[i] > 0 && pros[j] > 0){
			ans += cous[i] * pros[j];
		}else break;
	}
	cout << ans << endl;
	return 0;
}
/*
4 2 1 -1   max -> min
7 6 -2 -3   max -> min
28+12+3 = 43
*/