hdu1009,FatMouse' Trade,经典贪心算法

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 f p,p为j跟f的比值。房间以p降序排列。

不超过M的情况下依次加上每个房间的j值，最后一个房间按比列加上j值。

code:

#include<iostream>
#include<algorithm>
#include<cstdio>
#define MAX_NUM 1000
using namespace std;
typedef struct room
{
    int j,f;
    double p;
}room;
room r[MAX_NUM+5];
bool cmp(room a,room b)
{
    return a.p>b.p;
}
int main()
{
    int m,n,i;
    double sum;
    while(scanf("%d %d",&m,&n)==2,m!=-1||n!=-1)
    {
        sum=0.0;
        for(i=0;i<n;i++)
        {
            scanf("%d %d",&r[i].j,&r[i].f);
            r[i].p=double(r[i].j)/r[i].f;
        }
        sort(r,r+n,cmp);
        for(i=0;i<n;i++)
        {
            if(m>r[i].f)
            {
                sum+=r[i].j;
                m-=r[i].f;
            }
            else
            {
                sum+=m*r[i].p;
                m=0;
                break;
            }
        }
        printf("%.3f\n",sum);
    }
    return 0;
}