hdoj 1009 FatMouse' Trade

FatMouse' Trade

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

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<algorithm>
using namespace std;
struct Node{
	double j,f;
	double danjai; 
} a[1010];
bool cmp(Node a,Node b)
{
	return a.danjai<b.danjai;
}
int main()
{
	int n,m;
	double sum;
	while(~scanf("%d%d",&n,&m))
	{
		if(n==-1&&m==-1)
			return 0;
		for(int i=0;i<m;i++)
		{
			scanf("%lf%lf",&a[i].j,&a[i].f);
			a[i].danjai=a[i].f/a[i].j;
		}
		sort(a,a+m,cmp);
		sum=0;
		for(int i=0;i<m;i++)
		{
			if(n==0)
				break;
			if(n<a[i].f)
			{
				sum+=n/a[i].danjai;
				n=0;
			}		
			else
			{
				sum+=a[i].j;
				n-=a[i].f;
			}			
		}
		printf("%.3lf\n",sum);
	}
	return 0;
}