FatMouse' Trade（贪心）

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.

输入描述：

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.

输出描述：

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.

输入样例：

5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

输出样例：

13.333
31.500

#include<stdio.h>
#include<algorithm>
using namespace std;
struct p
{
  double a;
  double b;
  double c;
}v[1005];
bool cmp(p m,p n)
{
  return m.c>n.c;
}
int main()
{
     double m;
    int n;
    while(~scanf("%lf %d",&m,&n))
    {
      if(m==-1&&n==-1)
        break;
      int i;
      for(i=1;i<=n;i++)
      {
       scanf("%lf %lf",&v[i].a,&v[i].b);
        v[i].c=v[i].a/v[i].b;
      }
      sort(v+1,v+1+n,cmp);
      double out=0.0,in=0.0;
      for(i=1;i<=n;i++)
      {
       out+=v[i].a;
       in+=v[i].b;
       if(in>=m)
        break;
      }
      if(in>m)
      {
       out-=v[i].a;
       in-=v[i].b;
       out+=v[i].c*(m-in);
      }
      printf("%.3lf\n",out);
    }
return 0;
}