HDU_1009_FatMouse' Trade

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 45970    Accepted Submission(s): 15397

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

 1 #include<stdio.h>
 2 void bubblesort(double v[],int w[],int f[],int n)
 3 {
 4     int i,j;
 5     double t;
 6     for(i=1;i<=n;i++)
 7     {
 8         for(j=i+1;j<=n;j++)
 9         {
10             if(v[i]>v[j])
11             {
12                 t=v[i];
13                 v[i]=v[j];
14                 v[j]=t;
15                  
16                 t=f[i];
17                 f[i]=f[j];
18                 f[j]=t;
19                    
20                 t=w[i];
21                 w[i]=w[j];
22                 w[j]=t;                            
23             }
24         }
25     }
26 }
27 int main()
28 {
29     int n,m,i,w[1000],f[1000];
30     double v[1000],sum;
31     while(scanf("%d %d",&m,&n)!=EOF&&(n!=-1)&&(m!=-1))
32     {
33         for(i=1;i<=n;i++)
34         {
35         scanf("%d %d",&w[i],&f[i]);
36         v[i]=f[i]*1.0/w[i];
37         }
38         bubblesort(v,w,f,n);
39         
40         sum=0;
41         for(i=1;i<=n&&v[i]<=m&&m>0;i++) 
42         {
43              
44             if(m>=f[i]) 
45             {
46                 sum+=w[i];
47                 m=m-f[i];
48             }
49             else
50             {
51                 sum+=m*1.0/v[i]; 
52                 m=0;
53             }  
54         }
55         printf("%.3lf\n",sum);     
56     }
57 }

View Code

 

转载于:https://www.cnblogs.com/renqiqiang/p/5263625.html