hdu 1009 FatMouse' Trade

#include <stdio.h>#include <algorithm>using namespace std;struct node{    double J;//JavaBeans    double F;//cat food    double avg;// JavaBeans/cat food};node nData[1000];bool comp(node &a,node &b){    return a.avg > b.avg;}int main(){    double m;    int i,n;    double result;    while(scanf("%lf %d",&m,&n) && m != -1 && n != -1)    {        result = 0;        for(i = 0; i < n; ++i)        {            scanf("%lf %lf",&nData[i].J,&nData[i].F);            nData[i].avg = nData[i].J / nData[i].F;        }        sort(nData,nData+n,comp);//降序排序        for(i = 0; i < n; ++i)        {            if(m > nData[i].F)            {                result += nData[i].J;                m -= nData[i].F;            }            else            {                result += m*nData[i].avg;                break;            }        }        printf("%.3f\n",result);    }    return 0;}