hdu 1009 FatMouse' Trade

   

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 
       
       

 

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
struct SS
{
    double a;
    double b;
    double c;
}S[1020];
bool cmp(SS A,SS B)
{
    return A.c>B.c;
}
int main()
{
    int m;
    int n;
    while(~scanf("%d %d",&m,&n))
    { if(m==-1&&n==-1)
            break;
       memset(S,0,sizeof(S));
       double sum=0;
        int i;
        for(i=0;i<n;i++)
            {scanf("%lf %lf",&S[i].a,&S[i].b);
            S[i].c=S[i].a*1.0/S[i].b;
            }
            sort(S,S+n,cmp);
            for(i=0;i<n;i++)
            {
                if(S[i].b>m)
                {
                    break;
                }
                m-=S[i].b;
                sum+=S[i].a;
            }
            if(i<=n-1)
                sum+=m*S[i].a/S[i].b;
            printf("%.3lf\n",sum);

    }
}