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 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

Sample Output
13.333
31.500

J[i]/F[i]后排序，根据 M 可得最大值。（贪心）
PS：因为注释里的顺序问题，折腾半天0.0 坑

#include<stdio.h>
#include<stdlib.h>
struct p{

       double a,b,c;
       }t[1010];
    int  cmp(const void *x,const void *q) 
     {
       double f= (*(struct p*)q).c- (*(struct p*)x).c;
    if(f>0) return 1;
    else return -1;
     } 
int main()
{
      double s=0;
      double m;
      int n,i,j;
    while(scanf("%lf%d",&m,&n)!=EOF&&m!=-1&&n!=-1)
    {
       for(i=0;i<n;i++)
        { scanf("%lf%lf",&t[i].a,&t[i].b);
         t[i].c=(double)t[i].a/t[i].b;}
               qsort(t,n,sizeof(t[0]),cmp);
              s=0; 
         for(j=0;j<n;j++)
         {
            if(m>=t[j].b) {s+=t[j].a;m-=t[j].b;}
            else {s+=(t[j].a/t[j].b)*m;break;}
          /*if(t[j].b>m){s+=m*t[j].c;break;}
           else {s+=t[j].a;m-=t[j].b;}*/
         }
         printf("%0.3lf\n",s);
    }
  return 0;
}