hdu 1009 FatMouse' Trade(贪心)

FatMouse' Trade

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

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
  
  

 

Author

CHEN, Yue

 

Source

ZJCPC2004

题目大意：给定一些交易方式，选取适合交易方式获取最大利益

题目分析：直接按照单位猫粮换取的鼠粮从大到小排序，顺次选取即可

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#define MAX 1007

using namespace std;

int n,m;

struct Point
{
    int j,f;
    bool operator < ( const Point& a ) const
    {
        return j*1.0/f > a.j*1.0/a.f;
    }
}p[MAX];

int main ( )
{
    while ( ~scanf ( "%d%d" , &m , &n ) )
    {
        if ( m == -1 && n == -1 ) break;
        for ( int i = 1 ; i <= n ; i++ )
            scanf ( "%d%d" , &p[i].j , &p[i].f );
        sort ( p+1 , p+n+1 );
        int i = 1;
        double ans = 0;
        while ( m >= p[i].f && i <= n )
        {
            ans += p[i].j;
            m -= p[i].f;
            i++;
        }
        if ( i <= n )
            ans += m*1.0/p[i].f*p[i].j;
        printf ( "%.3lf\n" , ans );
    }
}