FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22453 Accepted Submission(s): 6992
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 3 7 2 4 3 5 2 20 3 25 18 24 15 15 10 -1 -1
Sample Output
13.333 31.500
贪心:按J[i]/F[i]降序,依次找最大的就行了
View Code
1 #include<iostream> 2 #include<algorithm> 3 #include<cstdio> 4 #define N 1010 5 using namespace std; 6 7 struct SS{double r,j,f;}a[N]; 8 9 bool cmp(SS A,SS B) 10 { 11 if(A.r>B.r) return true; 12 return false; 13 } 14 15 int main() 16 { 17 int n,m,i; 18 double ans; 19 while(cin>>m>>n&&(n!=-1&&m!=-1)) 20 { 21 for(i=0;i<n;i++) 22 { 23 cin>>a[i].j>>a[i].f; 24 a[i].r=(a[i].j/a[i].f); 25 } 26 sort(a,a+n,cmp); 27 ans=0; 28 for(i=0;i<n;i++) 29 { 30 if(a[i].f<=m) 31 { 32 ans+=(a[i].j); 33 m-=a[i].f; 34 } 35 else 36 { 37 ans+=a[i].r*m; 38 break; 39 } 40 } 41 printf("%.3lf\n",ans); 42 } 43 return 0; 44 }