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 NCcoupon 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
解析:直接看4个数组后排序,注意0的情况
大于0的一组,小于0的一组
#include<bits/stdc++.h>
using namespace std;
#define ee exp(1)
#define p acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int maxn=1e5+5;
ll a[maxn],b[maxn],c[maxn],d[maxn];
int n,m;
int cmp(int x,int y)
{
return x>y;
}
int main()
{
ll total=0;
ll t;
scanf("%d",&n);
int x=0,y=0;
int e=0,f=0;
for(int i=0; i<n; i++)
{
scanf("%lld",&t);
if(t==0)continue;
else if(t>0)a[x++]=t;
else b[y++]=t;
}
scanf("%d",&m);
for(int i=0; i<m; i++)
{
scanf("%lld",&t);
if(t==0)continue;
else if(t>0)c[e++]=t;
else d[f++]=t;
}
sort(a,a+x,cmp);
sort(b,b+y);
sort(c,c+e,cmp);
sort(d,d+f);
x=min(x,e);
y=min(y,f);
for(int i=0; i<x; i++)
{
total+=a[i]*c[i];
}
for(int i=0; i<y; i++)
{
total+=b[i]*d[i];
}
printf("%lld\n",total);
return 0;
}