hdu1009FatMouse' Trade(贪心)

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 97478    Accepted Submission(s): 33916

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

 

题意：给出猫粮的数量，用猫粮作为货币买java(?)豆，在豆子充足的情况下，有多少钱就能买多少豆子

题解：根据单价从小到大排序，先买便宜的。写得有点乱。。。

#include<bits/stdc++.h>
using namespace std;
struct node {
    int weight;//豆子数量 
    int mao;//猫粮数量 
    double weight1;//单价 
} a[1005];
bool cmp(node x,node y) {
    return x.weight1>=y.weight1;
}
void init() {
    for(int i=0; i<1005; i++) {
        a[i].weight=0;
        a[i].weight1=0;
        a[i].mao=0;
    }
}
int main() {
    int n;
    double m;
    while(~scanf("%lf %d",&m,&n)) {
        if(n==-1&&m==-1)break;
        init();
        for(int i=0; i<n; i++) {
            scanf("%d %d",&a[i].weight,&a[i].mao);
            a[i].weight1=a[i].weight*1.0/a[i].mao;
        }
        sort(a,a+n,cmp);
        double ans=0;
        for(int i=0; i<n; i++) {
            if(a[i].mao<=m) {
                ans+=a[i].weight;
                m-=a[i].mao;
            } else {
                ans+=m*a[i].weight1;
                break;
            }
        }
        printf("%.3lf
",ans);
    }
    return 0;
}