部分背包_FatMouse' Trade

source

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 Jii pounds of JavaBeans and requires Fii pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get Jii* a% pounds of JavaBeans if he pays Fii* 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 Jii and Fii 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>
 struct node {
     double j,f,velu;
 }java[1000+5];
 double M;
 int N;
 bool cmp(node a,node b) {
     return a.velu>b.velu;
}
int main() {
    while(scanf("%lf%d",&M,&N)&&!(M==-1||N==-1)) {
        double sum=0;
        for(int i=1;i<=N;++i) {
            scanf("%lf%lf",&java[i].j,&java[i].f);
            java[i].velu=1.0*java[i].j/java[i].f;
        }
        if(N>1)
        std::sort(java+1,java+N+1,cmp);
        for(int i=1;;++i) {
            if(N==0)
            break;
            if(M>=java[i].f) {
                M-=java[i].f;
                sum+=java[i].j;
            }
            else{
                sum+=1.0*M*java[i].j/java[i].f;
                break;
            }
        }
        printf("%.3lf\n",sum);
    }
    return 0;
}