1164FatMouse' Trade(贪心算法)

ummm.sort排序果然好用。

我有五块钱，最多能买多少豆子？

现在有两块钱一斤，一块钱一斤，和十块钱一斤的豆子。最好是能买一块钱一斤的豆子啦~这样豆子最多

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

HINT

杭电1009

Source

#include<stdio.h>
#include<algorithm>
using namespace std;
struct t
{
    double a;
    double b;
    double c;
}k[1000];
bool cmp(t p,t q)
{
    return p.c>q.c;
}
int main()
{
   int i,m,n;
   double sum;
   while(scanf("%d %d",&m,&n)!=EOF&&m!=-1&&n!=-1)
   {
       for(i=0;i<n;i++)
       {
           scanf("%lf %lf",&k[i].a,&k[i].b);
           k[i].c=k[i].a/k[i].b;
       }
       sort(k,k+10,cmp);
       sum=0;
       for(i=0;i<n;i++)
       {
           if(m>k[i].b)
           {
               sum+=k[i].a;
               m-=k[i].b;
           }//如果需要的m大于房间里需要的b
           else
           {
            sum+=(m*k[i].c);
            break;
           }
       }
       printf("%.3lf\n",sum);
   }
   return 0;
}