HDU 1009.FatMouse' Trade【贪心算法】【8月16】
2015-08-16 16:10
393 查看
FatMouse' Trade
Problem Description
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.
Input
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.
Output
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.
Sample Input
Sample Output
这个·····贪心不想多说,代码很简单:
Problem Description
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.
Input
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.
Output
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.
Sample Input
5 3 7 2 4 3 5 2 20 3 25 18 24 15 15 10 -1 -1
Sample Output
13.333 31.500
这个·····贪心不想多说,代码很简单:
#include<cstdio> #include<algorithm> using namespace std; struct ss{ double val,wei,vval; }; bool cmp(ss x,ss y){ if(x.vval>y.vval) return true; else return false; } int main(){ int n,m; while(scanf("%d%d",&m,&n)!=EOF&&(n!=-1&&m!=-1)){ ss f[1010]; for(int i=0;i<n;i++){ scanf("%lf %lf",&f[i].wei,&f[i].val); f[i].vval=f[i].wei/f[i].val; } sort(f,f+n,cmp); double Max=0; for(int i=0;i<n&&m>0.000001;i++){ if(m>=f[i].val){ Max+=f[i].wei; m-=f[i].val; } else{ Max+=m*f[i].vval; m=0; } } printf("%.3f\n",Max); } return 0; }
相关文章推荐
- POJ 1273 Drainage Ditches 最大流
- Java基础 笔记(1)
- 回溯法之Fire Net
- redis配置文件redis.conf详细说明
- 利用ThinkPHP的行为扩展做系统日志
- 8大排序算法总结
- 机房学习篇——数据Excel导出
- mysql锁研究系列一(锁的基本概念)
- linux系统中scp命令的用法(Permission denied排错二例)
- CodeVS第二次月赛 B
- 1088. Rational Arithmetic (20)
- Windows下为64位的python3.4.3安装numpy
- R语言系列:datasets(R自带数据包)
- linux学习之路(7)
- 教你用200行Python代码“换脸”
- linux学习之软链接和硬链接
- 五种内部类形式将线程隐藏于类中
- 在Win10上使用Visual Studio2015的Android模拟器
- CodeVS 第二次月赛 A
- poj 2516 Minimum Cost