PAT 甲级 1070. Mooncake (25)
来源:互联网 发布:java中常用io流类 编辑:程序博客网 时间:2024/05/22 10:27
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 <vector>#include <algorithm>#include <string>#include <set>using namespace std;struct Node {double amount;double profit;double pp;};bool cmp(Node a, Node b) {return a.pp > b.pp;}int main() {int n, m;scanf("%d %d", &n, &m);vector<Node> v(n);for (int i = 0; i < n; i++) {scanf("%lf", &v[i].amount);}for (int i = 0; i < n; i++) {scanf("%lf", &v[i].profit);v[i].pp = v[i].profit / v[i].amount;}sort(v.begin(), v.end(), cmp);double ans = 0;for (int i = 0; i < n; i++) {if (v[i].amount <= m) {ans += v[i].profit;m -= v[i].amount;}else {ans += m*v[i].pp;break;}}printf("%.2f", ans);cin >> ans;return 0;}
- PAT甲级1070. Mooncake (25)
- 1070. Mooncake (25)-PAT甲级
- 【PAT甲级】1070. Mooncake (25)
- PAT 甲级 1070. Mooncake (25)
- 1070. Mooncake (25)-PAT甲级真题
- PAT甲级练习1070. Mooncake (25)
- 1020 月饼 PAT PAT乙级&&1070. Mooncake (25) PAT甲级
- pat甲级 10700---Mooncake
- 【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)
- PAT A 1070. Mooncake (25)
- ZJU-PAT 1070. Mooncake (25)
- c++面试题
- Hibernate4 save方法无法保存数据
- 【bzoj2733】【HNOI2012】永无乡
- leetcode 336. Palindrome Pairs 回文数字符串对
- 命令行执行python文件时提示ImportError: No module named 'xxx'
- PAT 甲级 1070. Mooncake (25)
- bzoj2653
- C语言内存管理函数
- 无向图割点(割点后求连通分量个数)
- Tomcat连接xampp集成下的mysql服务器
- hadoop分布式集群搭建
- UVA 170 Clock Patience
- 网易2018校招编程题
- <c语言经典100例>c26:汉诺塔问题--递归