杭电acm1009

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
   
   
解题思路：这道题的题目我都花了好久才看懂，大意是老鼠有M的猫食，有N个房间，去换每个房间中的食物，第i个房间中，J[i]的猫食可以换取F[i]的食物，哪样可以使老
   
   
鼠换取的食物最多。即J[i]/F[i]越大，则老鼠能在这个房间中的食物越多，将J[i]/F[i]的值从大到小放在数组a[i]中，用选择排序法，同时J[i],F[i]也交换位置，
   
   
如果M>全部交换第一个房间食物需要的F[i],则可以全部和第一个房间交换，否则，和下一个房间交换。
   
   


   
   
我的代码：
   
   


int main() {
	int M,N,i,j,tmp1,J[1000],F[1000];
	double a[1000],tmp2,sum;
	while(scanf("%d %d",&M,&N),M!=-1||N!=-1){
		for(i=0;i<N;i++){
			scanf("%d %d",&J[i],&F[i]);
			a[i]=1.0*J[i]/F[i];//这里别忘了1.0，后面是两个整数
			for(j=0;j<i;j++)
			if(a[i]>a[j]){//选择排序
				tmp2=a[i];
				a[i]=a[j];
				a[j]=tmp2;
				
				tmp1=J[i];
				J[i]=J[j];
				J[j]=tmp1;
				
				tmp1=F[i];
				F[i]=F[j];
				F[j]=tmp1;
			}
		}
		sum=0;
	    for(i=0;i<N;i++){
	    	if(M>F[i]){
	    	sum+=J[i];
	    	M-=F[i];
		}
	    	else{
	    		sum+=1.0*a[i]*M;
	    		break;
			}
		}
		printf("%.3lf",sum);	
	}
	return 0;
}

   
   
运行结果：
   
   


   
   


   
   
在做这道题时，百度了很久，最终终于弄明白了这道题，并自己再写了出来，坚持吧，虽然我还是acm的小白