FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62867 Accepted Submission(s): 21223
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之前做的了,只是重温了一下,贴出来;这题意在求出单价,然后注意比较价值与总剩余量的大小即可。代码:#include<cstdio> #include<algorithm> using namespace std; struct node { int a; int b; double p;//价值和代价的比值 }f[1100]; double cmp(node x,node y)//对比值从大到小排序 { return x.p>y.p; } int main() { int n,m,i; double s; while(scanf("%d%d",&m,&n)&&(m!=-1)||(n!=-1)) { s=0.0; for(i=0;i<n;i++) { scanf("%d%d",&f[i].a,&f[i].b); f[i].p=f[i].a*1.0/f[i].b; } sort(f,f+n,cmp); for(int i=0;i<n;i++) { if(m>f[i].b) { s+=f[i].a; m-=f[i].b; } else { s+=m*f[i].p; break; } } printf("%.3lf\n",s); } return 0; }