[hdu]FatMouse' Trade

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

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磅的猫粮，跑去各个层去用猫粮贿赂猫，来换取肥老鼠最喜欢的食物（javabean...）。第i层的猫需要用F[i]磅的猫粮去换J[i]磅的javabean。当然也可以用一部分猫粮去换一部分的javabean，比如F[i]* a%的猫粮换J[i]* a%的javabean。问肥老鼠最多能换多少磅的javabean。

题解：典型的贪心。J[i]/F[i]越大，就越划算。所以建立一个结构数组，然后完成排序。cmp函数的建造挺有意思的。

#include "iostream"
#include "stdio.h"
#include "algorithm"
using namespace std;
typedef struct {
	double j,f,m;
}trade;
int cmp(trade a,trade b)
{
	return a.m>b.m;
}
int main()
{
	int  M,N;
	while(cin>>M>>N&&M!=-1&&N!=-1)
	{
		trade a[1005];
		double sum=0;
		for(int i=0;i<N;i++){cin>>a[i].j>>a[i].f;a[i].m=a[i].j/a[i].f;}
		sort(a,a+N,cmp);
		for(int i=0;i<N&&M>0;i++)
		{
			if(M>=a[i].f)
			{
				M-=a[i].f;
				sum+=a[i].j;
			}
			else 
			{
				sum+=a[i].m*M;
				M=0;
			}
		}
		printf("%.3f\n",sum);
	}
	return 0;
}