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
思路
这是一个很经典的贪心题目哈,直接根据给出的数据算出每个月饼的单价,并且按照单价从高到低排序,然后根据需求量进行选择:总是选择单价高的月饼,如果当前月饼没库存了,就找单价次高的月饼。
【坑点】:库存量最好设成double型,不要设成int型,否则测试点2会答案错误。
代码
#include<cstdio>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<iostream>
using namespace std;
const int maxn = 1010;
struct mooncake{
double inventory;
double totalPrice;
double unitPrice;
}Cake[maxn];
bool cmp(mooncake a, mooncake b){
return a.unitPrice>b.unitPrice;
}
int main()
{
int N, D;
scanf("%d%d", &N, &D);
for(int i=0;i<N;i++){
double tmpInventory;
scanf("%lf", &tmpInventory);
Cake[i].inventory = tmpInventory;
}
for(int i=0;i<N;i++){
double tmpPrice;
scanf("%lf", &tmpPrice);
Cake[i].totalPrice = tmpPrice;
Cake[i].unitPrice = Cake[i].totalPrice/Cake[i].inventory;
}
sort(Cake, Cake+N, cmp);
double sum = 0;
for(int i=0;i<N;i++){
if(D<=Cake[i].inventory){
sum += D*Cake[i].unitPrice;
D = 0;
}
else{
sum += Cake[i].totalPrice;
D -= Cake[i].inventory;
}
if(D==0) break;
}
printf("%.2f", sum);
return 0;
}