hdoj 1009 FatMouse' Trade

FatMouse' Trade

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

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
  
  

 

题意：FatMouse有m猫食，有n间仓库，每一间仓库中FatMouse可以用f[i]的猫食换j[i]的粮食，求FatMouse的所有猫粮最多可以换多少粮食。猫粮和粮食是可以分割的。

代码:

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
struct record
{
	double ave;
	double j;
	double f;
}num[1100];
bool cmp(record a,record b)
{
	return a.ave>b.ave;
}
//bool cmp(record a,record b)  
//{  
//    if(a.j*b.f!=a.f*b.j)  
//    return (a.j*b.f>a.f*b.j);  
//    else  
//    return (a.f>b.f);  
//}  
int main()
{
	int m,n;
	while(scanf("%d%d",&m,&n)&&n!=-1||m!=-1)
	{
		double sum1=0,sum2=0,sum=0;
		int a,i;
		for(i=0;i<n;i++)
		{
			scanf("%lf%lf",&num[i].j,&num[i].f);
			num[i].ave=num[i].j/num[i].f;
		}
		sort(num,num+n,cmp);
		for(i=0;i<n;i++)
		{
			if(sum1+num[i].f<=m)
			{
				sum1+=num[i].f;
				sum2+=num[i].j;
			}
			else
			{
				sum2+=num[i].j*(m-sum1)/num[i].f;
				sum1=m;
			}
			if(sum1==m)
			break;
//			sum1+=num[i].f;
//			if(sum1>m)
//			{
//				a=i;
//				break;
//			}
//			sum2+=num[i].j;
//			if(sum1==m)
//			{
//				a=-1;
//				break;
//			}
		}
//		if(a==-1)
//		{
//		    printf("%.3lf\n",sum2);	
//		}
//		else
//		{
//			sum1-=num[a].f;
//			sum=num[a].j*(m-sum1);
//			sum2+=sum/num[a].f;
//			printf("%.3lf\n",sum2);
//		}
        printf("%.3lf\n",sum2);
	}
	return 0;
}