1037. Magic Coupon

标签：c++   pat   

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.

#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
using namespace std;
vector<long> cp;
vector<long> cn;
vector<long> pp;
vector<long> pn;
int main ()
{
    int cup,pro,i;
    long temp,sum=0;
    scanf("%d",&cup);
    for( i=0;i<cup;i++)
    {
         scanf("%ld",&temp);
         if(temp>=0) cp.push_back(temp);
         if(temp<0) cn.push_back(temp);
         }
    scanf("%d",&pro);
    for( i=0;i<pro;i++)
    {
         scanf("%ld",&temp);
         if(temp>=0) pp.push_back(temp);
         if(temp<0) pn.push_back(temp);
         }
    sort(cp.begin(),cp.end());
    reverse(cp.begin(),cp.end());
    sort(cn.begin(),cn.end());
    sort(pp.begin(),pp.end());
    reverse(pp.begin(),pp.end());
    sort(pn.begin(),pn.end());
    int cps=cp.size(),cns=cn.size(),pps=pp.size(),pns=pn.size();
    int pmin=min(cps,pps),nmin=min(cns,pns);
    for( i=0;i<pmin;i++) sum+=cp[i]*pp[i];
    for( i=0;i<nmin;i++) sum+=cn[i]*pn[i];
    printf("%ld\n",sum);
    system("pause");
    return 0;
    
    }

1037. Magic Coupon

标签：c++   pat   

原文地址：http://blog.csdn.net/lchinam/article/details/44044843