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

题意描述：老鼠有m个货币去换自己喜欢的食物，求最多能换多少。先输入一行为老鼠货币m，以及下列n行，下列n行代表用b个货币可以换取a克食物。求最多能换取多少食物。

#include<stdio.h>
int main()
{
	int i,j,m,n;
	double ans[1001],h,l,k,p,b[1001],a[1001];
	while(scanf("%d%d",&m,&n)!=EOF,m!=-1&&n!=-1)
	{
		k=0.0;
		for(i=1;i<=n;i++)
		{
			scanf("%lf%lf",&a[i],&b[i]);
			ans[i]=a[i]/b[i];
		}
		for(i=1;i<n;i++)
			for(j=i+1;j<=n;j++)
			{
				if(ans[i]<ans[j])
				{
					h=ans[i];
					ans[i]=ans[j];
					ans[j]=h;
					l=b[i];
					b[i]=b[j];
					b[j]=l;
					p=a[i];
					a[i]=a[j];
					a[j]=p;
				} 
			}   \\ 先将a[]和b[]按照他们的相除之后数的大小一同进行排序
		for(i=1;i<=n;i++)
		{
			if(b[i]<=m)
			{
				k+=a[i];
				m=m-b[i];
			}
			else
			{
			if(b[i]>m)
			{
				k+=m*ans[i];
				break;
			}
			}
		}
		printf("%.3f\n",k);
	}
	return 0;
 }