FatMouse' Trade（贪心算法）

FatMouse’ Trade

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

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 x
	{
		double a,b;
		double c;
	};
	x s[10000];
	
	struct rull{
	
	bool operator()(const x &s1,const x &s2)
	{
	 return s1.c>s2.c;	
	 } 
};
/*bool compare(x s1,x s2)
{
return s1.c>s2.c;
}
*/
//这样也可以作为重载
	
int main()
{
	int m,n;
	while(scanf("%d%d",&m,&n)&&m!=-1&&n!=-1){
	
	for(int i=0;i<n;i++)
	{
		scanf("%lf%lf",&s[i].a,&s[i].b);
		s[i].c = 1.0*s[i].a/s[i].b*1.0; 
		} //b为支付，a为收到 
		sort(s,s+n,rull());
		double sum = 0;
		double num = 0;
		for(int i = 0;i<n;i++)
		{
			if(m-num - s[i].b>=0.000001 )
			{
				sum += s[i].a;
				num += s[i].b;
				
			}
			else
			{
			
			sum+=(m-num)*s[i].c;
			break;//**注意break；不然会wa**
		}
		}
	 printf("%.3lf\n",sum);
}
	 return 0;
 }