HDU 1009 FatMouse' Trade
2016-07-09 14:09
405 查看
FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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<stdio.h> #include<stdlib.h> #include<algorithm> using namespace std; const int MAXN = 1010; struct node { double j,f; double r; } a[MAXN]; bool cmp(node a,node b) { return a.r > b.r; } int main() { int N; double M; double ans; while(scanf("%lf%d",&M,&N)) { if(M==-1&&N==-1) break; for(int i=0; i<N; i++) { scanf("%lf%lf",&a[i].j,&a[i].f); a[i].r=(double)a[i].j/a[i].f; } sort(a,a+N,cmp); ans=0; for(int i=0; i<N; i++) { if(M>=a[i].f) { ans+=a[i].j; M-=a[i].f; } else { ans+=(a[i].j/a[i].f)*M; break; } } printf("%.3lf\n",ans); } return 0; }
相关文章推荐
- jQuery插件开发
- maven搭建nexus私服在myeclipse中的使用
- 信息构建——personas分析(基于落网的用户画像分析)
- Node.js EventEmitter
- Android:xUtils3浅析(二)——数据库模块
- java实现数字螺旋矩阵
- Node.js 事件循环
- Android 复习6 fragment argument
- Android-androidstudio懒惰开发-必备插件
- 如何在安装Linux之后修改Swap分区大小
- Node.js 回调函数
- POJ1703-Find them, Catch them
- 火爆的口袋妖怪是如何开发出来的?我们带你去了解下它的开发商
- 红黑树(附完整C代码)
- Node.js REPL(交互式解释器)
- NPM 使用介绍
- 1035. Password (20)
- 夏令营第一题
- leetcode :Reverse Vowels of a String
- 考前总结小本本