1070 Mooncake (25 分) 贪心

最新推荐文章于 2020-11-28 21:25:07 发布

原创最新推荐文章于 2020-11-28 21:25:07 发布 · 412 阅读

0 ·

CC 4.0 BY-SA版权

PAT-A 专栏收录该内容

85 篇文章

订阅专栏

本文探讨了在中秋节期间，如何根据市场总需求和不同种类月饼的库存与价格，制定销售策略以实现利润最大化。通过具体案例分析，展示了一种算法解决方案，该方案能够有效地在限定需求内选择最优的月饼组合进行销售。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Note

题意：已知总每种的总销售额和数量，求需求之内最大利润
注意测试点2卡住，amouts以千位单位，要是double型

Code

#include<iostream>
#include<algorithm>
using namespace std;
const int MAX = 1E5;
struct product{
	double amout;
	double sum_price;
	double value;
}products[MAX];
bool cmp(product a, product b){
	return a.value < b.value;
}

int main(){ 
    int num, i;
    int max_need;
    cin >> num >> max_need;
    for(int i = 0; i < num; i++){
        cin  >> products[i].amout;
    }
    for(int i = 0; i < num; i++){
        cin >>products[i].sum_price;
        if(products[i].amout != 0) products[i].value =products[i].sum_price /products[i].amout;
        else products[i].value = 0;
    }
    sort(products, products + num, cmp);
    int sell_num = 0;
    double sell = 0;
    int j = num - 1;
    while(sell_num + products[j].amout <= max_need && j >= 0){
        sell +=products[j].sum_price;
        sell_num +=  products[j].amout ;
        j--;
    }
    if( j >= 0 && sell_num+ products[j].amout  > max_need){
        sell += (max_need - sell_num) * products[j].value;
    }
    printf("%.2lf", sell);
    return 0;

}