SDJZU-FatMouse' Trade
来源:互联网 发布:安卓优化清理大师 编辑:程序博客网 时间:2024/06/01 21:29
http://sdjzu.acmclub.com/index.php?app=problem_title&assignment_id=1016&problem_id=2134
题目描述
FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.
The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain.
输入格式
The input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000.
输出
For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.
样例输入
4 2
4 7
1 3
5 5
4 8
3 8
1 2
2 5
2 4
-1 -1
样例输出
2.286
2.500
分析:
#include <iostream>#include <algorithm>#include <iomanip>using namespace std;struct cat{ double food; double java; double avg;};bool cmp(cat a,cat b){ return a.avg>b.avg;}int main(){ int n,m,i; struct cat ti[1005]; while (cin>>m>>n) { if(m==-1&&n==-1)break; for(i=0; i<n; i++) { cin>>ti[i].java>>ti[i].food; ti[i].avg=ti[i].java/ti[i].food; } sort(ti,ti+n,cmp); double count=0; double total=m; for(i=0; i<n; i++) { if(total-ti[i].food>=0)//如果全部能装下 { count+=ti[i].java; total-=ti[i].food; } else { count+=total*ti[i].avg; break; } } cout<<fixed<<setprecision(3)<<count<<endl; } return 0;}
- SDJZU-FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- cocos2d 中使用 pickerView 简单的老虎机应用
- [LeetCode] Next Permutation、Permutations、Permutations II、Permutation Sequence
- C++ 异常使用总结(持续更新)
- 数学之美--平凡而又神奇的贝叶斯方法(四)
- UVA 729 - The Hamming Distance Problem 解题报告
- SDJZU-FatMouse' Trade
- VC控件通知消息类型
- DWR一直处于加载状态的问题解决
- Baby-step giant-step
- 各大IT公司校园招聘程序猿笔试、面试题集锦
- MyEclipse中安装SVN插件
- libpcap BSD Packet Filter(BPF)
- Cocos2d-x-2.1.4之Android工程创建及编译
- POJ 1269 Intersecting Lines 判断直线间的状态(平行、重合、相交于一点)