HDU 1009 (FatMouse' Trade)

FatMouse' Trade

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
  
  
  
  


  
  
  
  

   
   
#include <stdio.h>
#include <algorithm>
using namespace std;
struct data
{
	int  jb;
	int  cf;
} a[10000];                 //定义一个结构体来存储每组数据中的 catfood 和  javabean；  
bool cmp( data c,data d )
{
	double a=c.jb*1.0/c.cf;double b=d.jb*1.0/d.cf;
	return  a>b;                //对结构体进行排序，规则为相对能拿到更多javabean的仓库在前 ； 
}
int main()
{
	double sum=0;int t,n;
	while(scanf("%d%d",&n,&t))
	{
		if(n==-1&&t==-1)         //输入-1，-1时退出； 
		  break;
		for(int i=0;i<t;i++)
		{
			scanf("%d%d",&a[i].jb,&a[i].cf); //输入每个仓库中的 javabean 的数目和需要的 catfood 的数目 ； 
		}
		sort(a,a+t,cmp);
		for(int i=0;i<t;i++)
		{
			if(n>=a[i].cf)
			  {
			  	n-=a[i].cf;
			  	sum+=a[i].jb;
			  }
			else
			  {
			  	sum+=(n*1.0/a[i].cf)*a[i].jb;
			  	n=0;
			  }	  
		} 
		printf("%.3lf\n",sum);
		sum=0;
	}
	return 0;
}