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
解题思路:
题目要求给出买定量月饼能赚到的最大金钱数量,所以我们需要先算出每种月饼的单价,按照单价的高低进行排序,先卖贵的月饼,再卖便宜的月饼即可。
代码:
#include<bits/stdc++.h>
using namespace std;
typedef struct mooncake{//存储每种月饼的信息
double ton;// 所有总量
double tol;// 总金额数
double per_price;// 月饼单价
};
bool cmp(mooncake a,mooncake b){// 把单价贵的月饼放在前面
return a.per_price>b.per_price;
}
int main(){
int N,D;
scanf("%d %d",&N,&D);
mooncake c[N];
for(int i=0;i<N;i++){
double a;
cin>>a;
c[i].ton = a;
}
for(int i=0;i<N;i++){
double a;
cin>>a;
c[i].tol = a;
c[i].per_price = c[i].tol/c[i].ton;
}
sort(c,c+N,cmp);
double sum = 0;
double price = 0;
for(int i=0;i<N;i++){
if(sum+c[i].ton<=D){// 如果全卖完也没达到目标,则直接相加
price+=c[i].tol;
sum+=c[i].ton;
}else{
if(sum<D){// 若只需要卖一部分就能达到销售额
price+=c[i].per_price*(D-sum);
break;
}
break;
}
}
printf("%.2f",price);
return 0;
}