hdu 1009

FatMouse' Trade

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 37 24 35 220 325 1824 1515 10-1 -1

 

Sample Output

13.33331.500

 

/*
做法：贪心。将比值进行排序，高的在前，不停的贪心取，
*/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>
using namespace std;
const int maxn = 10000;
struct node
{double x,y;
 double mark;
}p[maxn];
bool cmp(const node a,const node b)
{
    return a.mark>b.mark;
}
int main(void)
{
    int m,n;
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        if(m==-1&&n==-1) break;
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&p[i].x,&p[i].y);
            p[i].mark = p[i].x/p[i].y;
        }
        sort(p,p+n,cmp);
        double sum=0;
        for(int i=0;i<n;i++)
        {
            if(m>=p[i].y)
            {
                sum+=p[i].x;
                m-=p[i].y;
            }
            else
            {
                sum+=(m/p[i].y)*p[i].x;
                break;
            }
            if(m<=1e-9) break;
        }
        printf("%.3f\n",sum);
    }
    return 0;
}