hdu 1009FatMouse' Trade

#include 
   
   
    
    
#include 
    
    
     
     
using namespace std;
struct node
{
    double j, f;
    double r;
}s[1001];
bool cmp(node a, node b)
{
    return a.r>b.r;
}
int main()
{
    int  n, m, i;

    while(scanf("%d%d", &m,&n)!=EOF)
    {
        if(m==-1&&n==-1)
         break;
       for(i=0; i
     
     
      
      =s[i].f)
           {
               m-=s[i].f;
               sum+=s[i].j;
           }
           else
           {
               sum+=(m/s[i].f)*s[i].j;
               m=0;
           }
           if(m==0)
            break;
       }
       printf("%.3lf\n", sum);
    }
    return 0;
}