1009 贪心算法 （简单分背包问题） 水题

FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 64290    Accepted Submission(s): 21802


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



Author
CHEN, Yue


Source
ZJCPC2004


Recommend
JGShining

#include<stdio.h>
#include <stdlib.h>
typedef struct{
    int J;
    int F;
    double worth;
}real;
int cmp(const void*a,const void*b)
{
    return (*(real *)a).worth < (*(real *)b).worth?1:-1;
}
real room[1001];
int main(void)
{
    int M,n;
    while(~scanf("%d %d",&M,&n)&&(M!=-1)&&(n!=-1))
    {
        int i;double count=0;
        for(i=1;i<=n;i++)    
        {
            scanf("%d %d",&room[i].J,&room[i].F);
            room[i].worth=(double)room[i].J/(double)room[i].F;
        }
        qsort(room+1,n,sizeof(room[0]),cmp);//shows是从第一个下标存储数据
//printf("____________________________________________\n");
//for(i=1;i<=n;i++)
//printf("%lf\n",room[i].worth);
//printf("____________________________________________\n");
        for(i=1;i<=n&&M>0;i++)
        {
            if(M-room[i].F>=0) 
            {
                M-=room[i].F;
                count+=room[i].J;
//                printf("M==%d count==%lf\n",M,count);
//printf("____________________________________________\n");
            }
            else
            {
                count+=(double)M*room[i].worth;
                break;
            }
        }
        printf("%.3lf\n",count);
    }
}