杭电-1009 FatMouse' Trade
来源:互联网 发布:it行业 知乎 编辑:程序博客网 时间:2024/05/01 03:30
FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 66325 Accepted Submission(s): 22518
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.
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 37 24 35 220 325 1824 1515 10-1 -1
Sample Output
13.33331.500
Author
CHEN, Yue
Source
ZJCPC2004
Recommend
JGShining
AC代码:
<pre name="code" class="cpp">#include <stdio.h>#include <algorithm>using namespace std;struct Node{ double j,f,p;} node[10000];int cmp(Node x,Node y){ return x.p>y.p;}int main(){ int m,n; while(~scanf("%d%d",&n,&m) && (m!=-1 || n!=-1)) { double sum = 0,max = 0; int i,j; for(i = 0; i<m; i++) { scanf("%lf%lf",&node[i].j,&node[i].f); node[i].p = node[i].j/node[i].f; } sort(node,node+m,cmp); for(i = 0; i<m; i++) { if(n>=node[i].f) { sum+=node[i].j; n-=node[i].f; } else { sum+=node[i].p*n; break; } } printf("%.3lf\n",sum); } return 0;}
0 0
- 杭电1009 FatMouse' Trade
- 杭电1009 FatMouse' Trade
- 杭电1009-FatMouse' Trade
- 杭电 1009 FatMouse' Trade
- 杭电 1009 FatMouse' Trade
- 杭电1009--FatMouse' Trade
- 杭电 1009 FatMouse' Trade
- 【杭电1009】FatMouse' Trade
- 杭电-1009 FatMouse' Trade
- 【杭电1009】FatMouse' Trade
- 【杭电 1009】 FatMouse' Trade
- 【杭电】[1009]FatMouse' Trade
- 杭电1009 FatMouse' Trade
- 杭电 FatMouse' Trade
- 杭电-FatMouse' Trade
- 杭电 FatMouse' Trade
- 杭电 ACM 1009 FatMouse' Trade
- 杭电hdu 1009 FatMouse' Trade 贪心
- AngularJS Scope(作用域)
- MPRemoteCommandCenter
- 1032. 挖掘机技术哪家强(20)-PAT乙级真题
- hashCode() 和equals() 区别和作用
- 37定律的分析和模拟(随机数组的生成算法)
- 杭电-1009 FatMouse' Trade
- android应用去掉标题栏的方法
- IOS Cookie使用
- leetcode 367. Valid Perfect Square
- 关于oracle客户端不能使用的解决办法
- Java WebService 简单实例
- 1031. 查验身份证(15)-PAT乙级真题
- 广播——使用广播接收者接收短信
- DateTimePicker控件(日期时间选择器)《笔记5》