hdu_1009_FatMouse' Trade
来源:互联网 发布:广联达计价软件gbq 编辑:程序博客网 时间:2024/06/16 05:31
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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简单的贪心问题,按照j/f比值由大到小排序,而且要用double型数据。#include <stdio.h>#include <algorithm>using namespace std;struct node{ double j,f,ave;};node a[1002];double m;int n;bool cmp(node a,node b){ return a.ave>b.ave;}int main(){ while(scanf("%lf%d",&m,&n)!=EOF&&m!=-1&&n!=-1) { double sum=0; for(int i=1;i<=n;i++) { scanf("%lf%lf",&a[i].j,&a[i].f); a[i].ave=(a[i].j/a[i].f); } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++) { if(m>=a[i].f) { sum+=a[i].j; m-=a[i].f;} else {sum+=a[i].ave*m;break;} } printf("%.3lf\n",sum); } return 0;}
0 0
- hdu_1009_FatMouse' Trade
- HDU_1009_FatMouse'Trade
- trade
- Trade
- Trade Mark
- HDOJ_1009_FatMouse' Trade
- RQNOJ520 trade
- FatMouse' Trade
- Cross Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- FatMouse' Trade
- 白话空间统计之:空间异质性
- Message Flood SDUT
- [php] 二维码
- Activity的两种启动方式
- Mac 批量删除 .svn 文件
- hdu_1009_FatMouse' Trade
- php面向对象之final static const关键字的使用
- 暑假的第一次测试(二)
- 消息推送Android sdk集成指南
- 一些较好的资源
- 元素样式控制
- iOS开发问题之:应用语言是英文
- discuz搬家发布不了文章
- git 教程