注意:销售时允许取出一部分库存。样例给出的情形是这样的:假如我们有3种月饼,其库存量分别为18、15、10万吨,总售价分别为75、72、45亿元。如果市场的最大需求量只有20万吨,那么我们最大收益策略应该是卖出全部15万吨第2种月饼、以及5万吨第3种月饼,获得 72 + 45/2 = 94.5(亿元)
#include <iostream>
#include <vector>
#include <algorithm>
#define MAX 1000 + 10
using namespace std;
class Bing{
public:
double weight;
double value;
double price;
};
Bing bing[MAX];
int cmp( Bing a, Bing b ) {
return a.price > b.price;
}
int main() {
int N;
int D;
cin >> N >> D;
for ( int i = 0; i < N; i++ ) {
cin >> bing[i].weight;
}
for ( int i = 0; i < N; i++ ) {
cin >> bing[i].value;
bing[i].price = bing[i].value / bing[i].weight;
}
sort( bing, bing + N, cmp );
int now_weight = 0;
double sum = 0.0;
int index = 0;
while ( now_weight < D && index < N ) {
if ( D >= bing[index].weight ) {
D = D - bing[index].weight;
sum = sum + bing[index].value;
}
else {
sum = sum + D * bing[index].price;
D = 0;
}
index++;
}
printf( "%.2lf", sum );
return 0;
}