hdu 1009 FatMouse' Trade

FatMouse' Trade

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

//if(n>p[i].b)
//{
//    sum=sum+p[i].a;   不用这句话，就是WA，因为会掉精度
//    n=n-p[i].b;
//}
#include<bits/stdc++.h>
using namespace std;
struct node
{
    int a;
    int b;
    double c;
}p[1500];
int cmp(node x,node y)
{
    return x.c>=y.c;
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        double sum=0;
        if(n==-1&&m==-1) break;
        for(int i=1;i<=m;i++)
        {
            scanf("%d%d",&p[i].a,&p[i].b);
            p[i].c=double(p[i].a)/double(p[i].b);
        }
        sort(p+1,p+m+1,cmp);
        for(int i=1;i<=m;i++)
        {
            if(n>p[i].b)
            {
                sum=sum+p[i].a;
                n=n-p[i].b;
            }
            else
            {
                sum=sum+p[i].c*n;
                break;
            }
        }
        printf("%.3lf\n",sum);
    }
    return 0;
}