HDU1009FatMouse' 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

//类似于背包 结构体中加了一个平均值 对平均值进行排序
#include<stdio.h>
#include<algorithm>
using namespace std;

struct Node{
    double j,f,aver;
}str[1010];

bool cmp(Node x,Node y){
    return x.aver>y.aver;
}
int main(){
    int m,n;
    while(~scanf("%d %d",&m,&n)&&m!=-1&&n!=-1){        
    for(int i=0;i<n;i++){
        scanf("%lf %lf",&str[i].j,&str[i].f);
        str[i].aver=str[i].j/str[i].f;        
    }
    sort(str,str+n,cmp);
//    for(int i=0;i<n;i++){
//        printf("%lf %lf %lf",str[i].j,str[i].f,str[i].aver);
//    
//    }
    double sum=0.0;
    for(int i=0;i<n;i++){
        if(str[i].f<=m){
            sum+=str[i].j;
            m-=str[i].f;
        }
        else{
            sum+=m*str[i].j/str[i].f;
            break;//!!!
        }
    }
    printf("%.3lf\n",sum);
}
    return 0;
}