FatMouse' Trade

FatMouse’ Trade

Describe
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<iostream>
#include<algorithm>
#include<cstdio>

using namespace std;

struct node{
    double j;
    double f;
    double rate;
}home[1000];

bool cmp(const node& a,const node& b)
{
    return a.rate>b.rate;
}

int main()
{
    int m,n;
    double res;
    while(cin>>m>>n&&(m!=-1)&&(n!=-1))
    {
        for(int i=0;i<n;i++)
        {
            cin>>home[i].j>>home[i].f;
            home[i].rate=home[i].j/home[i].f;
        }
        sort(home,home+n,cmp);
        res=0;
        for(int i=0;i<n;i++)
        {
            if(m>=home[i].f)
            {
                m-=home[i].f;
                res+=home[i].j;
            }
            else
            {
                res+=((double)m*home[i].j/home[i].f);
                m=0;
            }
            if(m==0&&home[i+1].j>0) break;
        }
        printf("%.3f\n",res);
        //cout<<fixed<<setprecision(3)<<res<<endl会WA，比较坑。。。
    }
    return 0;
}