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 N 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
.
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
//1037 贪心加双指针
// 如果大于0,总是最大的两个数相乘,如果小于0总是两个最小的相乘
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int nc,np;
ll cou[100005];
ll pro[100005];
vector<ll> res;
ll sum=0;
int main()
{
memset(cou,0,sizeof(cou));
memset(pro,0,sizeof(pro));
cin>>nc;
for(int i = 0;i<nc;i++)
scanf("%lld",&cou[i]);
cin>>np;
for(int i = 0;i<np;i++)
scanf("%lld",&pro[i]);
sort(cou,cou+nc); //排序
sort(pro,pro+np);
int i;
//只换大于0的 ,最小的和最小的最大的和最大的
for(i = 0;i<nc&&i<np;i++)
{
if(cou[i]<0&&pro[i]<0)
sum+=(cou[i]*pro[i]);
else break;
}
for(int j = 1;nc-j>=0&&np-j>=0;j++)
{
if(cou[nc-j]>0&&pro[np-j]>0) sum+=(cou[nc-j]*pro[np-j]);
else break;
}
cout<<sum<<endl;
return 0;
}