1009 FatMouse' Trade

FatMouse' Trade

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

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
  
  
  
  

   
   

  
  
  
  

   
   

  
  
  
  

   
   

  
  
  
  

   
   #include<cstdio>
#include<cstdlib>


int main(){
	int N,M;
	while(scanf("%d%d",&M,&N) != EOF){
		int j[10002];
		int f[10002];
		double t[10000];
		double temp;
		int temp2;
		double num= 0;
		
		if(M ==-1&&N==-1){
			break;
		}
		
		for(int i=0;i<N;i++){
			scanf("%d%d",&j[i],&f[i]);
			t[i]=(j[i]*1.0)/f[i]; 
		}
	
		
		
		for(int i =0;i<N;i++)
		{
			for(int a=0;a<N-1-i;a++)
			{
				if(t[a] < t[a+1])
				{
				temp = t[a];
				t[a] = t[a+1];
				t[a+1]=temp;
				
				temp2=f[a];
				f[a] = f[a+1];
				f[a+1] = temp2;
				
				temp2=j[a];
				j[a] = j[a+1];
				j[a+1] = temp2;
				
				}
			}
		}
		
		for(int i=0;i<N;i++){
		
		if(M>=f[i]){
			num+=j[i];
			M-=f[i];
			
		}
		else{
			num+=t[i]*M;
			break;
		}
}
	printf("%.3lf\n",num);
	
		
	}
	
	return 0;
	
}