PAT-A-1037. Magic Coupon (25)

最新推荐文章于 2022-03-01 16:06:52 发布

dhk1234567

最新推荐文章于 2022-03-01 16:06:52 发布

阅读量150

点赞数

分类专栏： PAT-A

本文链接：https://blog.csdn.net/doglovecow/article/details/70306415

版权

PAT-A 专栏收录该内容

101 篇文章 0 订阅

订阅专栏

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 <= 10⁵, and it is guaranteed that all the numbers will not exceed 2³⁰.

Output Specification:

For each test case, simply print in a line the maximum amount of money you can get back.

Sample Input:

Sample Output:

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

int a[100010];
int b[100010];
int c[100010];
int d[100010];

int cmp1(int a, int b)
{
  return a > b;
}

int cmp2(int a, int b)
{
  return a < b;
}

int main()
{
  int nc, np;
  int n;
  int money = 0;
  int numa, numb, numc, numd;
  numa = numb = numc = numd = 0;

  cin >> nc;
  for (int i = 0; i < nc; i++)
  {
    cin >> n;
    if (n >= 0)
      a[numa++] = n;
    else
      b[numb++] = n;
  }

  cin >> np;
  for (int i = 0; i < np; i++)
  {
    cin >> n;
    if (n >= 0)
      c[numc++] = n;
    else
      d[numd++] = n;
  }

  sort(a, a + numa, cmp1);
  sort(c, c + numc, cmp1);
  sort(b, b + numb, cmp2);
  sort(d, d + numd, cmp2);

  int num;
  num = numa < numc ? numa : numc;
  for (int i = 0; i < num; i++)
  {
    money += a[i] * c[i];
  }

  num = numb < numd ? numb : numd;
  for (int i = 0; i < num; i++)
  {
    money += b[i] * d[i];
  }

  cout << money << endl;
  system("pause");
  return 0;
}