杭电1009 FatMouse' Trade(贪心)

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 44460    Accepted Submission(s): 14869

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
   
   
/*
测试的时候没看懂题意
Time:2014-10-19
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAX 1010
#define eps 1e-7
struct Warehouse{
	double F,J;
}h[MAX];
bool cmp(Warehouse a,Warehouse b){
	return a.F/a.J>=b.F/b.J;
}
int main(){
	int N;
	double M;
	while(scanf("%lf%d",&M,&N)!=EOF){
		if(N==-1&&M==-1) break;
		for(int i=0;i<N;i++){
			scanf("%lf%lf",&h[i].F,&h[i].J);
		}
		sort(h,h+N,cmp);
		double ans=0;
		for(int i=0;i<N;i++){
			if(M>=h[i].J){
				M-=h[i].J;
				ans+=h[i].F;
			}else{
				ans+=((M/h[i].J)*h[i].F);
				break;
			}
		}
		printf("%.3lf\n",ans);
	}
return 0;
}