PAT-A-1070. Mooncake (25)
来源:互联网 发布:mac 安装非app store 编辑:程序博客网 时间:2024/06/05 17:33
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<cstdio>#include<stdio.h>#include<algorithm>using namespace std;struct cake{ double num; double sum; double price;}c[10010];int cmp(cake c1, cake c2){ return c1.price > c2.price;}int main(){ int n, demand; double money = 0; int m = 0; cin >> n >> demand; for (int i = 0; i < n; i++) cin >> c[i].num; for (int i = 0; i < n; i++) { cin >> c[i].sum; c[i].price = c[i].sum / c[i].num; } sort(c, c + n, cmp); int i = 0; while (m+c[i].num <= demand&&i<n) { money += c[i].sum; m += c[i].num; i++; } if (i<n) money = (demand - m)*c[i].price + money; /*for (int i = 0; i < n; i++) { if (m + c[i].num <= demand) { money += c[i].sum; m += c[i].num; } else { money = (demand - m)*c[i].price + money; break; } }*/ printf("%.2lf", money); system("pause"); return 0;}
- PAT A 1070. Mooncake (25)
- PAT(A) - 1070. Mooncake (25)
- PAT-A 1070. Mooncake (25)
- PAT-A-1070. Mooncake (25)
- Pat(A) 1070. Mooncake (25)
- 【PAT】1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- pat 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT (Advanced) 1070. Mooncake (25)
- ZJU-PAT 1070. Mooncake (25)
- PAT甲级1070. Mooncake (25)
- 1070. Mooncake (25)-PAT甲级
- 【PAT甲级】1070. Mooncake (25)
- PAT 甲级 1070. Mooncake (25)
- 熄灯之后的学习——再读《MySQL必知必会》(4)|| 排序数据
- Struts2-Action-8-系列问题(包含模块配置文件、defaultAction)
- SAP SMP iOS kapsel打包注意事项
- 使用stm32主从门控模式精确控制脉冲个数
- 蓝桥杯 圆的面积 java
- PAT-A-1070. Mooncake (25)
- rabbitmq的命令和Web UI管理消息服务器
- 1002. A+B for Polynomials (25)
- Linux中用户管理
- Oracle基本概念
- Springboot + Devtools(热部署)
- 可重入函数
- 路由器开启WDS模式扩展WIFI覆盖范围
- linux(ubuntu)上配置java环境