pat甲级1037. Magic Coupon (25)

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/richenyunqi/article/details/79580069

欢迎访问我的pat甲级题解目录哦https://blog.csdn.net/richenyunqi/article/details/79958195

1037. Magic Coupon (25)

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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

算法设计:

题目设置的背景有些难懂,但其实这道题的意思很简单,给定两个序列,从这两个序列中每次分别拿出一个数字进行相乘,问最终得到的所有成绩之和最大是多少。(序列中每个数字最多只能用一次,当然也可以不用)

解决这道题需要使用贪心算法,贪心策略是:

对于正数和负数分开考虑,对于正数,肯定是大的整数乘大的正数得到的乘积更大;对于负数,肯定是小的负数乘小的负数得到的乘积更大。

注意点:

(1)要注意正负数分数不同以及存在0的情况

(2)进行累加的循环中,不能以coupon[i]*product[j]>0或者coupon[i]*product[j]<0为判断条件,因为这会在两个序列正负数个数相同时发生错误

(3)最好用long long 类型存储,以免数据溢出

c++代码:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int NC,NP;
    scanf("%d",&NC);
    long long coupon[NC];
    for(int i=0;i<NC;++i)
        scanf("%lld",&coupon[i]);
    scanf("%d",&NP);
    long long product[NP];
    for(int i=0;i<NP;++i)
        scanf("%lld",&product[i]);
    sort(coupon,coupon+NC);
    sort(product,product+NP);
    long long result=0;
    for(int i=0;i<NP&&i<NC&&coupon[i]<0&&product[i]<0;++i)
        result+=coupon[i]*product[i];
    for(int i=NC-1,j=NP-1;i>=0&&j>=0&&coupon[i]>0&&product[j]>0;--i,--j)
        result+=coupon[i]*product[j];
    printf("%lld",result);
    return 0;
}

阅读更多

扫码向博主提问

日沉云起

用最短的代码,写最快的算法
  • 擅长领域:
  • 算法
去开通我的Chat快问
换一批

没有更多推荐了,返回首页