1070. Mooncake (25)

1070. Mooncake (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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<iostream>  
#include<cstdio>  
#include<cstring>  
#include<algorithm>  
using namespace std;  
#define N 1000+10  
struct node{  
    double num;//数量   
    double prr1;//总售价   
    double prr2;//每一吨的单价   
}a[N];  
bool cmp(node x,node y){//按单价进行排序   
    return x.prr2 > y.prr2;  
}  
int main(){  
//  freopen("input.txt","r",stdin);  
    int n,m;  
    double sum = 0.0;  
    scanf("%d%d",&n,&m);  
    for(int i = 0;i < n;i++){  
        scanf("%lf",&a[i].num);  
    }  
    for(int i = 0;i < n;i++){  
        scanf("%lf",&a[i].prr1);  
        a[i].prr2 = (a[i].prr1*1.0)/a[i].num;  
    }  
    sort(a,a+n,cmp);  
    int cnt = 0;  
    while(m >= 0&&cnt < n){//如果没达到市场需求并且还有库存取出进行销售，注意是小于n，小于等于会有一个点过不去   
        if(m >= a[cnt].num){//判断需求是否大于库存   
            sum += a[cnt].prr1*1.0;  
            m -= a[cnt].num;  
        }else{  
            sum += a[cnt].prr2*m;//单价乘于需求   
            m = 0;//需求为0   
        }  
        cnt++;  
    }  
    printf("%.2lf\n",sum);  
    return 0;  
}