hdu 1009 FatMouse' Trade

FatMouse' Trade

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

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
  
  

 

 题目大致意思是，告诉你一只老鼠有M多的食物，接下来有N组数据，每一组数据包含J[i]表示第i个房间里有多少食物，F[i]钱可以换取J[i的]食物，而且这里可以不必每一组都全换，可以有一个a%的比例。。。

按性价比排序，再来一个一个的买，直到钱没有了。

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
struct food
{
    double j;
    double f;
    double price;
};
bool cmp(const food &f1,const food &f2)
{
    return f1.price>=f2.price;
}
using namespace std;
int main()
{
    double m;
    int n;
    double Max;
    food f[1001];
    while (cin>>m>>n &&(m!=-1 || n!=-1))
    {
        Max=0;
        for (int i=0; i<n; i++)
        {
            cin>>f[i].j>>f[i].f;
            f[i].price=f[i].j*1.0/f[i].f;
        }
        sort(f, f+n, cmp);
        for (int i=0; i<n; i++)
        {
            if(m==0)
            {
                break;
            }
            if(m>=f[i].f)
            {
                Max+=f[i].j;
                m-=f[i].f;
            }
            else
            {
                Max+=(f[i].j*1.0/f[i].f)*m;
                m=0;
                break;
            }
        }
        printf("%.3f\n",Max);
    
    }
    return 0;
}