PAT A1037 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 NC 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
以下是AC的代码:
#include<cstdio>
#include<cstring>
#include<set>
#include<algorithm>
using namespace std;
const int maxn = 100100;
int coup[maxn]={0}, prod[maxn]={0};
bool cmpc(int a,int b){
return a>b;
}
int main(void){
int nc,np;
scanf("%d",&nc);
for(int i=0;i<nc;i++){
scanf("%d",&coup[i]);
}
sort(coup,coup+nc,cmpc);
scanf("%d",&np);
for(int i=0;i<np;i++){
scanf("%d",&prod[i]);
}
sort(prod,prod+np,cmpc);
int money = 0;
int i=0,j=0;
for(;i<nc&&j<=np&&coup[i]>0&&prod[j]>0;i++,j++){//先算正的;
money+=coup[i]*prod[j];
}
for(i=nc-1,j=np-1;i>=0&&j>=0&&coup[i]<0&&prod[j]<0;i--,j--){
money+=coup[i]*prod[j];
}
printf("%d",money);
return 0;
}
思路:
只有所有加到总money 里面的钱都是正的的时候,会得到最多的钱;所以这里将coupon 和 product从大到小排序,先将 coupon 为正,product 也为正,乘积加到总钱数里;再循环一次,将两者都为负,但是乘积为正的结果加到总钱数里,就能得到最多的钱数。
虽然答案里说这里乘积可能会超过int 的范围,应该设置为 long long,但是这里实测用int 也不会出问题。