FatMouse' Trade（贪心）

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

分析：先根据J[i]和f[i]的比率进行从大到小排序，然后循环遍历，w=w-f[i]当f[i]>w时结束。

代码如下：

#include<stdio.h>
struct node
{
	double f;
	double y;
}s[1010];
void sort(struct node s[],int n)
{
	struct node t;
	int i,j;
	for(i=1;i<=n-1;i++)
	{
		for(j=1;j<=n-i;j++)
		{
			if(s[j].y/s[j].f<s[j+1].y/s[j+1].f)
			{
				t=s[j];
				s[j]=s[j+1];
				s[j+1]=t;
			}
		}
	}
}
int main()
{
	int i,j,n,w;
	double num;
	while(scanf("%d%d",&w,&n)!=EOF)
	{
		if(w==-1&&n==-1)
		break;
		num=0.0;
		for(i=1;i<=n;i++)
		{
			scanf("%lf%lf",&s[i].y,&s[i].f);
		}
		sort(s,n);
		for(i=1;i<=n;i++)
		{
			if(w==0)
			break;
			if(w>=s[i].f)
			{
				num+=s[i].y;
				w-=s[i].f;
			}
			else
			{
				num+=1.0*s[i].y*(1.0*w/s[i].f);
				w=0;
			}
		}
		printf("%.3lf\n",num);
	}
	return 0;
}