H电-Problem Archive-1009-FatMouse' Trade

FatMouse' Trade

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

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

  
  

   
   13.333
31.500
  
  

 

Author

CHEN, Yue

 

Source

ZJCPC2004

S:

#include<stdio.h>
double a[1001][2]={{0},{0}};
int main(void)
{
    double c,s,n;
    int i,j,m;
    while(scanf("%lf%d",&n,&m)!=EOF&&(n!=-1&&m!=-1))
    {
        for(i=0;i<m;i++)
            scanf("%lf%lf",&a[i][0],&a[i][1]);
            
        for(i=0;i<m;i++)
           for(j=i+1;j<m;j++)
                if(a[i][0]/a[i][1]<a[j][0]/a[j][1])
                {
                     c=a[i][0];
                     a[i][0]=a[j][0];
                     a[j][0]=c;
                       c=a[i][1];
                     a[i][1]=a[j][1];
                     a[j][1]=c;
                }
        
            
            s=0;
        for(i=0;i<m;i++)
        {
            if(a[i][1]<=n)
            {
                n=n-a[i][1];
                s=s+a[i][0];
            }
            else 
            {
                   s+=a[i][0]/a[i][1]*n;
                   break;
            }
        }
        printf("%.3lf\n",s);
    }
return 0;
}