A1037 Magic Coupon
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≤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
结尾无空行
分析:
这道题目和上道题目的难度差不多。
对于这道题目的负数的情况,我采用的是将它们分成两个数组来分别存储,一开始我还担心会超时~不过好在并没有啦
这样,只要对着四个数组进行排序,问题就能迎刃而解啦
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=100010;
int a[maxn];
int fa[maxn];
int b[maxn];
int fb[maxn];
bool cmp(int a,int b){//注意
return a>b;
}
int main(){
int m,n,temp;
int ans;//结果最好用long long存储
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d",&temp);
if(temp<0){
fa[i]=abs(temp);
}else{
a[i]=temp;
}
}
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&temp);
if(temp<0){
fb[i]=abs(temp);
}else{
b[i]=temp;
}
}
sort(a,a+m,cmp);
sort(fa,fa+m,cmp);
sort(b,b+n,cmp);
sort(fb,fb+n,cmp);
int i=0;
while(a[i]!=0&&b[i]!=0){
ans=ans+a[i]*b[i];//不要忘记i++
i++;
}
i=0;
while(fa[i]!=0&&fb[i]!=0){
ans=ans+fa[i]*fb[i];
i++;
}
printf("%d",ans);
return 0;
}