浙江大学PAT_甲级_1070. Mooncake (25)

最新推荐文章于 2025-03-15 10:57:44 发布

原创最新推荐文章于 2025-03-15 10:57:44 发布 · 650 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #C++ #浙江大学

PAT甲级专栏收录该内容

38 篇文章

订阅专栏

本文深入探讨了信息技术领域的关键组件和技术应用，包括开发工具、嵌入式硬件、音视频基础、AI音视频处理等，通过实例分析，帮助读者理解各组件的功能和应用场景，促进技术领域的学习和实践。

题目链接：点击打开链接

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

这题在乙级考试里出现过，点击打开链接.

我的C++代码：

#include<iostream>
#include<algorithm>
using namespace std;
struct mooncake
{
	double reserve;//库存量
	double all_price;//总价
	double unit_price;//单价
};
bool compare(mooncake a, mooncake b)
{
	return a.unit_price > b.unit_price;
}
int main()
{
	int i=0,n, requirement;
	double income = 0.0;
	mooncake cake[1001];
	cin >> n >> requirement;
	for (i = 0; i < n; i++)
	{
		cin >> cake[i].reserve;
	}
	for (i = 0; i < n; i++)
	{
		cin >> cake[i].all_price;
		cake[i].unit_price = cake[i].all_price / cake[i].reserve;
	}
	sort(cake, cake + n, compare);
	i = 0;
	while (requirement >0&&i<n)
	{
		if (requirement >= cake[i].reserve)
		{
			income = income + cake[i].reserve *cake[i].unit_price;
			requirement = requirement - cake[i].reserve;
			i++;
		}
		else
		{
			income = income + requirement*cake[i].unit_price;
			requirement = 0;
		}
	}
	printf("%.2f", income);
	//system("pause");
	return 0;
}