贪心--FatMouse‘ Trade--HDU1009

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

Code

#include <iostream>
#include <stdio.h>
#include <queue>
#include <string.h>
#include <map>
#include <math.h>
#include <algorithm>
#include <stack>
#include <iomanip>
using namespace std;

struct node{
    double prio;
    int ja,pou;

    node(double i, int j, int k){
        prio=i;
        ja = j;
        pou = k;
    }

    bool operator <(const node &tmp)const{
        return prio<tmp.prio;
    }
};

int main(){
    //freopen("/Users/guoyu/Desktop/algorithm/in.txt","r",stdin);
    double m;int n;
    while(cin>>m>>n&&m!=-1){
        priority_queue<node> q;
        while(n--){
            double ja, pou;
            cin>>ja>>pou;
            q.push(node(ja/pou, ja, pou));
        }
        double ans=0;
        while(!q.empty()){
            node tmp = q.top();q.pop();
            if(m>=tmp.pou){
                ans += tmp.ja;
                m -= tmp.pou;
            }
            else{
                ans += tmp.prio * m;
                m=0;
                break;
            }
        }
        cout<<fixed<<setprecision(3)<<ans<<endl;
    }
    return 0;
}