1070. Mooncake (25)【贪心】——PAT (Advanced Level) Practise
2015-12-27 23:03
609 查看
题目信息
1070. Mooncake (25)时间限制100 ms
内存限制65536 kB
代码长度限制16000 B
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
解题思路
贪心即可AC代码
[code]#include <cstdio> #include <algorithm> using namespace std; struct Node{ double num, value, per; bool operator<(const Node& b) const{ return per > b.per; } }node[1005]; int main() { int n; double v; scanf("%d%lf", &n, &v); for (int i = 0; i < n; ++i){ scanf("%lf", &node[i].num); } for (int i = 0; i < n; ++i){ scanf("%lf", &node[i].value); node[i].per = node[i].value / node[i].num; } sort(node, node + n); int p = 0; double s = 0; while (v > 0 && p < n){ if (node[p].num > v){ s += v * node[p].per; v -= v; }else{ s += node[p].value; v -= node[p].num; } ++p; } printf("%.2f\n", s); return 0; }
个人游戏推广:
《10云方》与方块来次消除大战!
相关文章推荐
- 解决mysql不能通过'/tmp/mysql.sock 连接的问题
- Docker介绍与安装使用(一)
- 怎么快速判断一篇论文的质量
- Java 匿名类
- 你自己不优秀,认识谁都是个屁
- sitemesh使用
- LeetCode之Dynamic Programming题目汇总
- DICOM:docker实现DICOM服务虚拟化
- 1069. The Black Hole of Numbers (20)【模拟】——PAT (Advanced Level) Practise
- JSP九大内置对象
- 【论文笔记】SparkNET: 用Spark训练深度神经网络
- 《CSS禅意花园》读后感
- 快速计算正弦波
- java JDBC访问Oracle数据库
- 多情剑客无情剑
- Kinect体感机器人(三)—— 空间向量法计算关节角度
- Linux通过Mutt发送Mysql慢查询邮件
- iOS-Objective-C 学习笔记一:数据类型
- Linux ->> scp命令复制对端机器上的文件/文件夹
- Kinect体感机器人(二)—— 体感识别