杭电-1009

FatMouse' Trade
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 53940    Accepted Submission(s): 18058




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

//hdu1009-FatMouse' Trade
//已知：每个房间的 JavaBeans数j[i],所需的catfood数f[i]; 
//题目大意：本题大意是用一定量 cat food获得最多 JavaBeans
//解题思路；解决本题的方法是贪心，为了能获得最多的 JavaBeans,只有对每个房间的（j[i]/f[i]）
//的值进行从小到大排序，先把最便宜（用catfood少且获得javabeans最多）的取完 ，依次取走剩下的
//直到将所有的catfood用完，即求的最优解。 
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
	double x;
	int y;
	double z;
}ans[1100];
bool cmp(node a,node b){
	return a.z>b.z;
}
int main() 
{
	int n,m,i,j;
	double x,y,sum;
	while(scanf("%d%d",&n,&m),(n!=-1||m!=-1)){
		getchar();
		sum=0;
		for(i=0;i<m;i++){
		  scanf("%lf%d",&ans[i].x,&ans[i].y);
		  ans[i].z=ans[i].x/ans[i].y;	
		}
		sort(ans,ans+m,cmp);
		for(i=0;i<m;i++){
			if(n>ans[i].y){
				sum+=ans[i].x;
				n-=ans[i].y;
			    }
			else
			{
				sum+=n*ans[i].z;
				break;
			}
		}
	printf("%.3f\n",sum);	 
	}
}