FatMouse' Trade

D - FatMouse' Trade

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1009

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

1. 20 3

4 3 5 2 25 18 24 15 15 10 -1 -1

 

Sample Output

1. 13.333
2. 31.500
5. 标准贪心问题，排序相比较就可以了
6. #include<stdio.h>
7. #include<stdlib.h>
8. #include <algorithm>
9. using namespace std;
10. typedef struct A
11. {
12.     double j,f;
13.     double r;
14. }A;
15. double temp(A a,A b){
16. if(a.r>b.r)
17. return 1;
18. else
19. return 0;
20. }
21. int main(){
22. A  a[1000];
23. A  tmp;
24.   int i,m,b,d,k;
25. double n,sum;
26. while(scanf("%lf%d",&n,&m)!=EOF&&n!=-1&&m!=-1){
27. for(i=0;i<m;i++){
28.         scanf("%lf%lf",&a[i].j,&a[i].f);
29. a[i].r=(double)a[i].j/a[i].f;
30. }
31. sort(a,a+m,temp);

1.  sum=0.0;
2.  for(k=0;k<m&&n>0;k++){
3. if(n>a[k].f){
4. sum+=a[k].j;
5. n-=a[k].f;}
6. else{
7. sum+=a[k].r*n;
8. n=0;
9. }
10. }
11. printf("%.3lf\n",sum);
12. }
13. }