PAT 1070 Mooncake (25 分)

原题链接：1070 Mooncake (25 分)
关键词：贪心

Mooncake is a Chinese bakery product traditionally eaten during the Mid-Autumn Festival. Many types of fillings and crusts can be found in traditional mooncakes according to the region’s culture. Now given the inventory amounts and the prices of all kinds of the mooncakes, together with the maximum total demand of the market, you are supposed to tell the maximum profit that can be made.

Note: partial inventory storage can be taken. The sample shows the following situation: given three kinds of mooncakes with inventory amounts being 180, 150, and 100 thousand tons, and the prices being 7.5, 7.2, and 4.5 billion yuans. If the market demand can be at most 200 thousand tons, the best we can do is to sell 150 thousand tons of the second kind of mooncake, and 50 thousand tons of the third kind. Hence the total profit is 7.2 + 4.5/2 = 9.45 (billion yuans).

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive integers N (≤1000), the number of different kinds of mooncakes, and D (≤500 thousand tons), the maximum total demand of the market. Then the second line gives the positive inventory amounts (in thousand tons), and the third line gives the positive prices (in billion yuans) of N kinds of mooncakes. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the maximum profit (in billion yuans) in one line, accurate up to 2 decimal places.

Sample Input:

3 200
180 150 100
7.5 7.2 4.5

Sample Output:

9.45

---

题目大意：

给定N种月饼、月饼的总需求量D以及各种月饼的供应量和总价格，问怎么样销售带来的利润最大。

分析：

首先根据存量和总价求出单位价值，根据单位价值对所有月饼排序。
用贪心的思想，月饼单位价值高的优先级高，优先级最高的月饼库存不够用就用第二高的，以此类推来达到最终金额最大。

注意：

总价给出是double型的， 因此在定义数量和均价的时候也要用double，否则答案会出错

---

代码实现：

#include <iostream>
#include <algorithm>
using namespace std;

int n;	//n种类数
double d;   //d需求量
struct mooncake{
    double num; //数量
    double val_sum; //总价
    double price; //均价
    
}cakes[1010];

bool cmp(mooncake a, mooncake b){
    return a.price > b.price;	//按均价从高到低排序
}

int main(){
    cin >> n >> d;
    
    for(int i = 0; i < n; i ++ ){
        cin >> cakes[i].num;
    }
    for(int i = 0; i < n; i ++ ){
        cin >> cakes[i].val_sum;
        cakes[i].price = cakes[i].val_sum / cakes[i].num;
    }
    
    sort(cakes, cakes + n, cmp);
    
    double ans = 0;
    for(int i = 0; i < n; i ++ ){
        if(d >= cakes[i].num){  //需求量大于当前存量
            ans += cakes[i].val_sum;
            d -= cakes[i].num;
        }
        else{   //需求量小于当前存量
            ans += cakes[i].price * d;
            break;
        }
    }
    printf("%.2f", ans);
    
    return 0;
}