1070 Mooncake (25分)【贪心】

最新推荐文章于 2022-08-20 18:30:58 发布

胡小涛

最新推荐文章于 2022-08-20 18:30:58 发布

阅读量210

点赞数

CC 4.0 BY-SA版权

分类专栏： PTA甲级

本文链接：https://blog.csdn.net/lovecyr/article/details/104771048

PTA甲级专栏收录该内容

71 篇文章

订阅专栏

本文探讨了在给定的市场总需求下，如何通过合理安排不同种类月饼的销售量来实现最大化的总利润。文章提供了一种基于单价排序的贪心算法解决方案，并通过示例展示了算法的具体应用。

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

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

题目大意：

现有月饼需求量为d，已知n种月饼各自的库存量以及总售价，问如何销售这些月饼使得获得最大收益。

解题思路：

这里采用贪心的思想，按照月饼的单价来对其排序，先出售单价高的月饼。

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

struct mooncake {
	double store;
	double sell;
	double price;
}cake[1010];

int cmp(mooncake a, mooncake b)
{
	return a.price > b.price;
}

int main()
{
	int n;
	double d;
	cin >> n >> d;
	for (int i = 0; i < n; i++)
	{
		cin >> cake[i].store;
	}
	for (int i = 0; i < n; i++)
	{
		cin >> cake[i].sell;
		cake[i].price = cake[i].sell / cake[i].store;
	}
	sort(cake, cake + n, cmp);
	double sum = 0;
	for (int i = 0; i < n; i++)
	{
		if (cake[i].store <= d)
		{
			d -= cake[i].store;
			sum += cake[i].sell;
		}
		else
		{
			sum += cake[i].price*d;
			break;
		}
	}
	printf("%.2f\n", sum);
	return 0;
}