HDOJ 1009 FatMouse' Trade

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 66367    Accepted Submission(s): 22546

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<stdio.h>
#include<algorithm> 
using namespace std;
struct node
{
	int j;
	int f;
	double q;//j与f的比值； 
}a[1100];
int cmp(node x,node y)
{
	return x.q>y.q; 
}
int main()
{
	int m,n;
	while(scanf("%d%d",&m,&n)&&(m!=-1)&&(n!=-1))
	{
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&a[i].j,&a[i].f);
			a[i].q=a[i].j*1.0/a[i].f;//整型除以整型得到整数 a[i].q为double型，要乘以1.0； 
		}
		sort(a,a+n,cmp);
		double sum=0;
		for(int i=0;i<n;i++)
		{
			if(m>=a[i].f)
			{
				sum+=a[i].j;
				m-=a[i].f;
			}
			else if(m>0&&m<a[i].f)
			{
				sum=sum+a[i].q*m; 
				break;
			}
		}
		printf("%.3lf\n",sum);
	}
	return 0; 
}