pat a1037

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
using namespace std;
bool cmp(int a,int b)
{
return a>b;
}
int main()
{
bool cmp(int a,int b);
int nc,np;
int sum=0;
int tmp=0;
int s[100000],s1[100000];
scanf("%d",&nc);
for(int i=0;i<nc;i++)
{
scanf("%d",&s[i]);
}
scanf("%d",&np);
for(int i=0;i<np;i++)
{
scanf("%d",&s1[i]);
}
sort(s,s+nc,cmp);
sort(s1,s1+np,cmp);
for(int i=0;i<nc&&i<np;i++)
{
if(s[i]>0&&s1[i]>0)
sum+=s[i]*s1[i];
}
int j=np-1;
for(int i=nc-1;i>0&&j>0;i–)
{
if(s[i]<0&&s1[j]<0)
{
sum+=s[i]*s1[j];
j–;
}
}
printf("%d",sum);
}