hdu 1009 FatMouse' Trade （贪心）

FatMouse' Trade

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 83   Accepted Submission(s) : 45

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

 

思路：将JavaBeans和cat foo的比例排序一下，比例越大说明获得的越多。

 

代码：

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
using namespace std;
struct node
{
    double a,b,c;
}a[1005];
bool cmp(node a,node b)
{
    if(a.c!=b.c)
    {
        return a.c>b.c;
    }
    else return a.b>b.b;
}
int main()
{
    int M,N;
    while(cin>>M>>N)
    {
        if(M==-1&&N==-1)break;
        else
        {
            int i;
            for(i=0;i<N;i++)
            {
                cin>>a[i].a>>a[i].b;
                a[i].c=a[i].a/a[i].b;
            }
            sort(a,a+N,cmp);
            double sum=0;
            for(i=0;i<N;i++)
            {
                if(a[i].b<=M)
                {
                    sum+=a[i].a;
                    M-=a[i].b;
                }
                else
                {
                    sum+=M*a[i].c;
                    M=0;
                }
                if(M<=0)
                {
                    break;
                }

            }
            printf("%.3lf\n",sum);
        }
    }
    return 0;
}