1070 Mooncake(贪心算法(求最高单价)）

1070 Mooncake (25 分)

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

/**
本题题意
    给定n种月饼， 以及所需要的月饼d
    第二行给出每种月饼总共的吨数
    第三行给出每种卖出去的总价
    现在需要求出在n种月饼在d范围内能卖出去最多的总价
本题思路：
    运用贪心思想， 1.优先选择单价最高的月饼，此种月饼选择完毕后， 就选择第二种单价最高的月饼
    一次类推
    因此设定一个结构体（方便整体排序 取出最高的单价） a存放数量(数量也要写为double类型，否则2测试点出错)， b存放总价
    c存放每种月饼的单价
    按照单价从大到小排好序后，
        a.对于数量 小于 d的月饼数量， 此时直接将全部月饼拿走，更新d 为 d -
    拿走月饼数量, 卖出的月饼总价为 拿走月饼数量 *  单价
        b. 对于数量 大于d的月饼数量， 此时  卖出的月饼总价为 d *  单价；
        
**/

 

#include<iostream>
#include<algorithm>
using namespace std;
const int maxsize = 1005;
int n, d;
struct Node{
	double a; //a 是数量 （注意a要写为double类型）
	double b, c; //b是总价 ， c是单价
}val[maxsize];
bool cmp(Node a, Node b){
	return a.c > b.c;
}
int main(){
	double sum = 0.0;
	scanf("%d%d", &n, &d);
	for(int i = 0; i < n; i++)
		scanf("%lf", &val[i].a); //a 是数量 
	for(int i = 0; i < n; i++){
		scanf("%lf", &val[i].b);
		val[i].c = val[i].b / val[i].a;
	}
	sort(val, val + n, cmp);
	for(int i = 0; i < n; i++){
		if(val[i].a < d){
			sum += val[i].b;
			d = d - val[i].a;
		}else{
			sum += val[i].c * d;
			break;
		}
	}
	printf("%.2lf\n", sum);
	return 0;
}