hdu 1009 FatMouse' Trade

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 66813    Accepted Submission(s): 22717

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

题意and题解：一个人有F斤食物，要拿这些食物去n个房间换宝贝，每个房间有J[i]斤宝贝，换完这些宝贝需要F[i]斤食物，他可以不换完一个房间里的所有宝贝，求此人用F尽食物最多能换多少宝贝。毫无疑问，肯定是要先换最便宜的，即对每个房间宝贝的单价进行从大到小排序，然后换取，直到食物被换完。----贪心---

<span style="font-family:SimSun;font-size:18px;">#include<stdio.h>
#include<algorithm>
using namespace std;
struct food
{
    double j;
    double f;
}cost[10000];
bool cmp(food a,food b)
{
    return (a.j/a.f)>(b.j/b.f);
}
int main()
{
    int n;
    double m;
    while(~scanf("%lf%d",&m,&n)&&!(m<0&&n<0))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&cost[i].j,&cost[i].f);
        }
        sort(cost,cost+n,cmp);
        double s=0;
        for(int i=0;i<n;i++)
        {
            if(cost[i].f>=m)
            {
                s+=cost[i].j/cost[i].f*m;  //即此房间的食物可能不会被换完 
                break;
            }
            else
            {
                s+=cost[i].j;
                m-=cost[i].f;
            }
        }
        printf("%.3lf\n",s);
    }
}</span>