PAT_A 1037. Magic Coupon (25)

最新推荐文章于 2022-12-17 09:43:44 发布

原创最新推荐文章于 2022-12-17 09:43:44 发布 · 510 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT-A1037 #贪心

PAT/天梯赛/Leetcode 专栏收录该内容

249 篇文章

订阅专栏

本文探讨了如何通过合理搭配正负数值的魔法券与商品价值来实现利益最大化的问题。通过对输入数据进行排序并采取特定匹配策略，实现了高效求解。

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:
4
1 2 4 -1
4
7 6 -2 -3
Sample Output:
43

分析：
- 该题目就是从两组数中相乘求和，使其最大。采用贪心即可，绝对值排序后把大的相乘求和即可，不计算乘积为负的组。这是开始采取的策略，但有一组超时。见代码２。
- 后来看了一下别人的代码,恍然大悟，原来自然排序后首尾各遍历一次相乘求和一次即可。代码１。
code1:

#include<iostream>
#include<vector>
#include<vector>
#include<algorithm>
using namespace std;
vector<int>coupon;
int v[100010];
vector<int>val;
int main()
{
    //freopen("in","r",stdin);
    fill(v,v+10010,0);
    int N,M,tmp;
    scanf("%d",&N);
    for(int i=0;i<N;i++)
    {
      scanf("%d",&tmp);
      coupon.push_back(tmp);
    }
    scanf("%d",&M);
    for(int i=0;i<M;i++)
    {
      scanf("%d",&tmp);
      val.push_back(tmp);
    }
    sort(coupon.begin(),coupon.end());
    sort(val.begin(),val.end());
    //加和增大，即是++ 或--
    //排序后，从小到大 --;从大到小++;中间部分为+-
    //所以首位各遍历一遍求和即可。
    int p,q,sum;
    sum=p=q=0;
    while(p<N&&q<M&&coupon[p]<0&&val[q]<0)
    {
        sum+=coupon[p++]*val[q++];
    }
    //注意M和N不一定相等
    p=N-1;
    q=M-1;
    while(p>=0&&q>=0&&coupon[p]>0&&val[q]>0)
    {
        sum+=coupon[p--]*val[q--];
    }
    cout<<sum<<endl;
    return 0;
}

code2(一个测试点超时):

#include<iostream>
#include<vector>
#include<vector>
#include<algorithm>
bool comp(int a,int b)
{
    int tmp_a=a>0?a:-a;
    int tmp_b=b>0?b:-b;
    return tmp_a>tmp_b;
}
using namespace std;
vector<int>coupon;
int v[100010];
vector<int>val;
int main()
{
    //freopen("in","r",stdin);
    fill(v,v+10010,0);
    int N,M,tmp;
    cin>>N;
    for(int i=0;i<N;i++)
    {
      cin>>tmp;
      coupon.push_back(tmp);
    }
    cin>>M;
    for(int i=0;i<M;i++)
    {
      cin>>tmp;
      val.push_back(tmp);
    }
    sort(coupon.begin(),coupon.end(),comp);
    sort(val.begin(),val.end(),comp);
    long sum=0;
    for(int i=0;i<N;i++)
    {
        for(int j=0;j<M;j++)
        {
            if(v[j]==1)
              continue;
            if(coupon[i]*val[j]<0)
              continue;
            else
            {
              v[j]=1;
              sum+=coupon[i]*val[j];
              break;
            }
        }
    }
    cout<<sum<<endl;
    return 0;
}