hdu 1009 详解

FatMouse’ Trade
Time Limit: 1000msMemory Limit: 32768KB This problem will be judged on HDU. Original ID: 1009
64-bit integer IO format: %I64d Java class name: Main
Prev Submit Status Statistics Next
Type:
None

Tag it!
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
Source

#include<iostream>
#include<algorithm>
using namespace std;
struct node
{
    double f, j, rat;
}a[2222];
bool cmp(node m, node n)
{
    return m.rat > n.rat;
}
int main()
{
    double m;
    int n;
    while (cin>>m>>n)
    {
        if (m == -1 && n == -1)
            break;
        int i;
        for (i = 0; i < n; i++)
        {
            cin >> a[i].j >> a[i].f;
            a[i].rat = a[i].j / a[i].f;
        }
        sort(a, a + n, cmp);
        double s = 0;
        for (i = 0; i < n; i++)
        {
            if (m - a[i].f >= 0)
            {
                m = m - a[i].f;
                s += a[i].j;
            }
            else
            {
                s += a[i].rat*m;
                break;
            }
        }
        printf("%.3lf\n", s);
    }
    return 0;
}