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.
InputThe 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.
OutputFor 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
1 #include<bits/stdc++.h> 2 using namespace std; 3 struct node{ 4 int j; /*理想下越大越好*/ 5 int f; /*理想下越小越好*/ 6 double rate; /*性价比*/ 7 }jb[1005]; 8 9 bool cmp(node a,node b) 10 { 11 if(a.rate != b.rate) 12 return a.rate > b.rate; 13 else 14 return a.f < b.f; 15 } 16 17 int main() 18 { 19 int m,n; 20 while(cin>>m>>n) /*m(固定的猫粮) n(房间数)*/ 21 { 22 if(m==-1&&n==-1) 23 break; 24 for(int i = 0; i< n; i++) 25 { 26 scanf("%d%d",&jb[i].j,&jb[i].f); /*j(房间内最多的JB数量)f(换购猫粮)*/ 27 jb[i].rate = jb[i].j*1.0/jb[i].f; /*记得在分子*1.0,否则出来的答案只能是int类型的*/ 28 } 29 sort(jb,jb+n,cmp); 30 double ans = 0; 31 32 for(int i = 0; i < n; i++) 33 { 34 //cout<<jb[i].rate<<" "<<jb[i].f<<endl; 35 if(m >= jb[i].f) 36 { 37 ans+=jb[i].j; 38 m -= jb[i].f; 39 }else{ 40 ans += jb[i].rate*m; /*根据计算公式推导*/ 41 break; 42 } 43 } 44 printf("%.3lf\n",ans); 45 } 46 return 0; 47 }