FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 79772 Accepted Submission(s): 27554
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
Author
CHEN, Yue
/*
**类型:贪心算法
**题目来源:HDU 1009
**时间:2017/7/29
**题意大概:
*/
#include<stdio.h>
#include<algorithm>
using namespace std;
struct rooms{
double javabean;
double Catfood;
}room[1005];
double cmp(rooms a,rooms b)
{
return a.javabean/a.Catfood > b.javabean/b.Catfood;
}
int main()
{
int M,N;
while(scanf("%d%d",&M,&N)!=EOF) //错误while(scanf("%d%d",&M,&N)!=EOF&&M==-1&&N==-1)
{
if(M==-1&&N==-1)
{
break;
}
for(int i = 0; i < N; i++)
{
scanf("%lf%lf",&room[i].javabean,&room[i].Catfood);
}
sort(room,room+N,cmp);
double MouseGet = 0;
for(int i = 0; i < N; i++)
{
if(M >= room[i].Catfood)
{
M -= room[i].Catfood;
MouseGet += room[i].javabean;
}else{
MouseGet += room[i].javabean*M/room[i].Catfood;
break;
}
}
printf("%.3lf\n",MouseGet);
}
return 0;
}