1070. Mooncake
2015-11-29 19:48
447 查看
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
考查:排序/贪心
CASE 4:段错误,在于d可能很大,用不完,从而导致数组越界。
#include<stdio.h> #include<iostream> #include<algorithm> using namespace std; struct Mooncake { float price; float amounts; float ratio; }buf[1002]; bool cmp(Mooncake A, Mooncake B) { return A.ratio > B.ratio; } int main() { freopen("F://temp/input.txt", "r", stdin); int n, d; double profit = 0; scanf("%d%d", &n, &d); for(int i = 0; i < n; i ++) scanf("%f", &buf[i].amounts); for(int i = 0; i < n; i++) { scanf("%f", &buf[i].price); buf[i].ratio = buf[i].price / buf[i].amounts; } sort(buf, buf+n, cmp); for(int i = 0; d > 0 && i < n; i ++) { if(d < buf[i].amounts) { profit = profit + d*1.0/buf[i].amounts*buf[i].price; break; } else { profit += buf[i].price; d -= buf[i].amounts; } } printf("%.2f\n", profit); return 0; }
[/code]
相关文章推荐
- CC1310笔记1:开发准备
- mac系统配置android adb环境
- 编程中无穷大常量的设置技巧
- VS2012安装步骤
- (spring-第12回【IoC基础篇】)JavaBean的属性编辑器
- ajax 第一节
- 工业4.0时代,我们引领未来
- mpich安装使用
- 自定义View
- Unity3D项目实战笔记(10):Unity3D编译IPA的PostEvents–节约时间利器
- hexo-学习写博客内容
- MySql修改数据库,表和字段的字符集
- 文件的操作2
- hdu 计算机学院大学生程序设计竞赛(2015’11)游乐场
- Unity3D项目实战笔记(10):Unity3D编译IPA的PostEvents–节约时间利器
- Swiftype添加站内搜索
- Java集合之Map
- OpenCv中cvCaptureFromFile返回NULL的问题
- UML——序列图
- 南通大学教务管理系统微信平台 用户体验