hdu 1009

FatMouse' Trade

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

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

 

Recommend

JGShining      |      We have carefully selected several similar problems for you:    1050  1051  2037  1052  1010 

//解题分析：本 题是简单的贪心算法，将单价排序，之后计算
//注意：排序时 如果出现被除数是0的情况！
#include
#include
#include
using namespace std;
struct stu{
  float pay;
  float get;
}room[1010];
bool cmp(stu a,stu b)
{
  if(a.pay==0)
  return 1;//当不要猫粮
  else if(b.pay==0)
  return 0;
  else
  return a.pay/a.get
}
int main()
{
  int   m,n,i,j;
  float sum;//注意sum的类型
  while(scanf("%d%d",&m,&n),n!=-1||m!=-1)
  {
    memset(room,0,sizeof(room));
    sum=0;
    for(i=0;i
    {
      scanf("%f%f",&room[i].get,&room[i].pay);
    }
    sort(room,room+n,cmp);
    for(i=0;i
    {
      if(m>room[i].pay)
      {
        m-=room[i].pay;
        sum+=room[i].get;
      }
      else
      {
        sum+=m/room[i].pay*room[i].get;
        break;//当出现else的情况后就要知道停止循环
      }
    }
    printf("%.3f\n",sum);
  }
  return 0;
}