1070 Mooncake (25point(s))

首先,先贴柳神的博客

https://www.liuchuo.net/ 这是地址

想要刷好PTA,强烈推荐柳神的博客,和算法笔记

目录

• 题目原文
  • Input Specification:
  • Output Specification:
  • Sample Input:
  • Sample Output:
  • 生词如下：
• 题目大意：
  • 思路如下：
  • 注意点：
  • 代码如下

题目原文

1070 Mooncake (25point(s))

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

生词如下：

inventory 库存

题目大意：

① 给N个月饼的库存量和他们的总价然后在给你一个总需求量，要你月饼厂家算出最划算的方案

思路如下：

① 把所有的月饼按单价排序,然后在按照排序一个一个算

注意点：

① 可能会发生月饼需求大于供给的情况,要及时跳出来

代码如下

#include<iostream>
#include<map>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
struct mooccake {
	double inventory;
	double price;
	double reallyprice;
};
bool cmp(mooccake a, mooccake b) {
	return a.reallyprice > b.reallyprice;
}
int main(void) {
	int  N;
	double D;
	int i;
	scanf("%d%lf", &N, &D);
	vector<mooccake> data(N);
	for (i = 0; i < N; i++) {
		scanf("%lf", &data[i].inventory);
	}
	for (i = 0; i < N; i++) {
		scanf("%lf", &data[i].price);
		
	}
	for (i = 0; i < N; i++) {
		data[i].reallyprice = data[i].price / data[i].inventory;
	}
	sort(data.begin(), data.end(), cmp);
	double sum = 0.0;
	i = 0;
	//这个写法不允许的原因是,有可能所有的月饼的库存都不能满足需求就会溢出
	/*while (D>=0){
		if (D>=data[i].inventory ) {
			sum += data[i].price;
			D =D- data[i].inventory;
		}
		else {
			sum =sum+ D * data[i].reallyprice;
			break;
		}
		i++;
	}*/

	for (int i = 0; i < N; i++) {
		if (D >= data[i].inventory) {
			sum += data[i].price;
			D = D - data[i].inventory;
		}
		else {
			sum = sum + D * data[i].reallyprice;
			break;
		}
	}
	printf("%.2lf", sum);
	return 0;
}