mooncake
来源:互联网 发布:软件著作权转让流程 编辑:程序博客网 时间:2024/06/08 08:58
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 200180 150 1007.5 7.2 4.5Sample Output:
9.45
#include<iostream>#include<map>#include<vector>#include<algorithm>using namespace std;int main(){int n,m1;cin>>n>>m1;vector<double> v1,v2;vector<pair<double,double> > vv;for(int i=0;i<n;i++){double temp;cin>>temp;v1.push_back(temp);}for(int i=0;i<n;i++){double temp1;cin>>temp1;v2.push_back(temp1);}for(int i=0;i<n;i++){pair<double,double> m;m.first=v2[i]/v1[i];//pair中第一个是单价,第二个是数量,排序,按照单价从大到小 m.second=v1[i];vv.push_back(m);}sort(vv.begin(),vv.end());double sum=0;for(int i=vv.size()-1;i>=0;i--){if(m1<=vv[i].second){sum+=vv[i].first*m1;break;}else{sum+=vv[i].first*vv[i].second;m1-=vv[i].second;}}printf("%.2lf",sum);return 0; }
- mooncake
- 1070. Mooncake
- 1070. Mooncake
- 1070.Mooncake
- pat1070 Mooncake
- 1070. Mooncake
- pat1070 Mooncake
- 1070. Mooncake
- 1070. Mooncake
- 1070. Mooncake
- PAT_1070. Mooncake
- 【PAT】1070. Mooncake (25)
- 1070. Mooncake (25)
- PAT 1070. Mooncake
- 1070. Mooncake (25)
- PAT 1070. Mooncake
- PAT 1070. Mooncake (贪心)
- 1070. Mooncake (25)
- qt多线程设计
- left join中on与where的区别
- hibernate4中使用Session doWork()方法进行jdbc操作(代码)
- xmanager(xstart5)连接centos6.5
- Linux-常用命令(1)
- mooncake
- HMM之前向算法
- autorun.inf U盘/光盘自动运行功能 完全操作手册
- 单向链表插入新节点
- ibatis sql语句问题
- 单向链表删除节点
- bzoj2453&2120 维护队列 可修改莫队算法/树套树
- 细谈c++左值的概念
- Mesos&Marathon实现容器部署