hdu1009 FatMouse' Trade w

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

AC Code

#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <math.h>

using namespace std;
#define inf 0x3f3f3f3f


struct ha{
	int J;
	int F;
	double d;
}mao[1010];

int cmp(ha a,ha b)
{
	return a.d>b.d;
}

int main(int argc, char** argv) {

	int n,m;
	while(cin>>m>>n,m!=-1,n!=-1)
	{
		int i;
		double sum=0.0;
		for(i=0;i<n;i++)
		{
			cin>>mao[i].J>>mao[i].F;
			mao[i].d=mao[i].J/(double)mao[i].F;
		}
		sort(mao,mao+n,cmp);

		for(i=0;i<n;i++)
		{
			if(m>=mao[i].F)
			{
				m-=mao[i].F;
				sum+=mao[i].J;
				
			}
			else
			{
				sum+=m*mao[i].d;
				break;
			}
			
		}
		printf("%.3lf\n",sum);
	}
	return 0;
}