hdu1009 nyoj824 FatMouse' Trade 简单贪心

FatMouse' Trade

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 22   Accepted Submission(s) : 10

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

#include<cstdio>
#include<algorithm>
using namespace std;

struct node{
	double j,f,ss;
};
 
bool cmp(node a,node b)
{
	if(a.ss>b.ss)	
	return true;
	else return false;
}

int main()
{ 
	double m,sum;
	int n;
	while(scanf("%lf%d",&m,&n))
	{
		if(n==-1||m==-1)break;
    	        node a[n];
		for(int i=0;i<n;i++)
		{
			scanf("%lf%lf",&a[i].j,&a[i].f);
			a[i].ss=a[i].j/(a[i].f);
		}
		sort(a,a+n,cmp);
		sum=0;
		for(int i=0;i<n;i++)
    	        {
			if(m>=a[i].f)
			{
				sum+=a[i].j;
				m-=a[i].f;
			}
			else 
			{
				sum+=m*a[i].j/a[i].f;
				break;
			}
    	        }
		printf("%.3lf\n",sum);
	}
	return 0;
 }