HDU-1009 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

题目大意：一共有n个房间，每个房间里都有老鼠喜欢吃的javabeans，但是每个房间里的javabeans的价格不一样。老鼠有m元。问最多可以卖多少javabeans，其中每个房间里的可以不用买完。

思路：主要就是求性价比，然后排序，先买性价比高的。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
    int J;
    int F;
    double mi;
} q[10000];
bool cmp(node u,node v)
{
    return u.mi>v.mi;
}
int main()
{
    int m,n;
    while(scanf("%d%d",&m,&n))
    {
        if(m==-1&&n==-1)
            return 0;
        for(int i=0; i<n; i++)
        {
            scanf("%d%d",&q[i].J,&q[i].F);
            q[i].mi=(1.0*q[i].J)/q[i].F;//性价比=性能/价格
        }
        sort(q,q+n,cmp);
        double sum=0,ans=0;
        for(int i=0; i<n; i++)
        {
            if(sum<=m)
            {
                if(sum+q[i].F<=m)
                {
                    ans+=q[i].J;
                    sum+=q[i].F;
                }
                else
                {
                    ans+=(m-sum)*q[i].mi;
                    sum=m;
                }
            }
            else
                break;
        }
        printf("%.3lf\n",ans);
    }
    return 0;
}