PAT(甲级)1037
来源:互联网 发布:编程之道 pdf 编辑:程序博客网 时间:2024/05/15 01:44
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 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:41 2 4 -147 6 -2 -3Sample Output:
43
#include <cstdio>#include <algorithm>#define SIZE 100005int Coupon[SIZE];int Product[SIZE];void swap(int &a,int &b){int tmp=a;a=b;b=tmp;}int main(){int NC,NP;scanf("%d",&NC);int i=0;for(i=0;i<NC;i++) scanf("%d",&Coupon[i]);scanf("%d",&NP);for(i=0;i<NP;i++) scanf("%d",&Product[i]);std::sort(Coupon,Coupon+NC);std::sort(Product,Product+NP);for(i=0;i<NC;i++){if(Coupon[i] > 0 ) break;}int cfirst=i;for(i=0;i<NP;i++) if(Product[i] > 0) break;int pfirst=i;int min = cfirst < pfirst ? cfirst:pfirst;long long res=0;for(i= 0 ;i<min;i++) res +=Coupon[i]*Product[i];cfirst = NC-cfirst;pfirst = NP-pfirst;min = cfirst < pfirst ? cfirst:pfirst;for(i=0;i<min;i++) res += Coupon[NC-1-i]*Product[NP-1-i]; printf("%lld\n",res); return 0;}
- PAT(甲级)1037
- 浙大PAT甲级 1037
- PAT甲级1037
- PAT甲级 1037 -- 没有注释
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1036
- LeetCode 19_Remove Nth Node From End of List
- 我读过的好书
- phpt文件说明,php官方自动测试方法,run-test.php命令用法
- 工具提示
- PAT(甲级)1037
- HDU - 1024 Max Sum Plus Plus(DP + 滚动数组)
- imread
- String,StringBuffer,StringBuild的区别
- HTML元素是什么?
- PAT(甲级)1038
- HDU - 1029 Ignatius and the Princess IV(暴力)
- Hadoop源代码学习
- 2015武汉校园招聘归来