1037. Magic Coupon (25)

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
   
   
两行中，每个数最多使用一次，上面的乘下面的加起来最大；我这里尝试使用deque，双向链表，其实使用两个一维数组，分别排好序，从左便开始，乘起来能大于0就加，否则从后面开始。
  
  
评测结果
 
 
时间
结果
得分
题目
语言
用时(ms)
内存(kB)
用户
8月05日
 12:32
答案正确
25
1037
C++
 (g++ 4.7.2)
52
1332
datrilla
测试点
 
 
测试点
结果
用时(ms)
内存(kB)
得分/满分
0
答案正确
1
308
10/10
1
答案正确
1
436
3/3
2
答案正确
1
308
3/3
3
答案正确
1
384
3/3
4
答案正确
52
1332
3/3
5
答案正确
1
180
3/3

#include<iostream>
#include<algorithm>
#include<deque>
using namespace std;
void readln(deque<int>*DQ)
{
  int goal,N;
  cin >> N;
  while (N--)
  {
    cin >> goal;
  (*DQ).push_back(goal);
    }
}
int getmost1(deque<int>*coupon, deque<int>*product, int sum)
{
  while(!coupon->empty() && !product->empty())
  {
    if (coupon->front()*product->front() > 0)sum += coupon->front()*product->front();
    else return sum;
    coupon->pop_front();
    product->pop_front();
  }
  return sum;
}
int getmost2(deque<int>*coupon, deque<int>*product, int sum)
{
  while (!coupon->empty() && !product->empty())
  {
    if (coupon->back()*product->back() > 0)sum += coupon->back()*product->back();
    else return sum;
    coupon->pop_back();
    product->pop_back();
  }
  return sum;
}
bool moreCMp(const int &a, const int&B){ return a > B; } 
int main()
{
  deque<int>coupon, product;
  int sum=0;
  readln(&coupon);
  readln(&product);
  sort(coupon.begin(), coupon.end(), moreCMp);
  sort(product.begin(), product.end(), moreCMp);
  sum = getmost1(&coupon, &product, sum);  
  sum = getmost2(&coupon, &product, sum);
  cout << sum << endl;
  system("pause");
  return 0;
}