A - FatMouse' Trade

Submit Status Practice HDU 1009

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

 

这题就是典型的贪心类算法，从比例最大的开始拿，那么就先以比例进行排序，排序好了以后进行选择

以下是ac的代码

 

 

 

#include<cstdio>
#include <iomanip>
#include<cstring>
#include<algorithm>
#include<iostream>
struct node{
    double a;
    double b;
    double c;
}cpp[1002];
bool cmp(node m,node n)
{
    if(m.c>n.c)
        return 1;
    else
        return 0;
}
using namespace std;
int main()
{
    int M,N;
    while(cin>>M>>N&&(M!=-1&&N!=-1))
    {
        int sum = M;
        double num=0;
        for(int i=0;i<N;i++)
        {
            cin>>cpp[i].a>>cpp[i].b;
            cpp[i].c=cpp[i].a/cpp[i].b;
        }
        sort(cpp,cpp+N,cmp);
        for(int i=0;i<N;i++)
        {
            if(cpp[i].b<sum)
            {
                sum-=cpp[i].b;
                num+=cpp[i].a;
            }
            else{
                num+=sum*(cpp[i].c);
                break;
            }
        }
        cout << fixed << setprecision(3) << num << endl;
    }

}