HDOJ FatMouse' Trade

FatMouse' Trade

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 21   Accepted Submission(s) : 9

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

Author

CHEN, Yue

Source

ZJCPC2004 

贪心策略：将J/F的值从大到小排序

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
struct Node
{
	int J;
	int F;
	double S;
}Room[1000];
int cmp(Node x,Node y)
{
	if(x.S!=y.S)
	return x.S>y.S;
	else 
	return x.S<y.S;
}
int main()
{
	int M,N,J,F;
	double S;//存储J/F的值(可能是小数，用double) 
	while(scanf("%d %d",&M,&N)!=EOF&&M!=-1&&N!=-1)
	{
		for(int i=0;i<N;i++)
		{
			scanf("%d %d",&Room[i].J,&Room[i].F);
			Room[i].S=1.0*Room[i].J/Room[i].F;
		}
		double sum=0;
		sort(Room,Room+N,cmp);//对J/F进行排序 
		for(int i=0;i<N&&M>=0;i++)
		{
			if(M>=Room[i].F)
			{
				sum+=Room[i].J;
				M-=Room[i].F;
			}
			else
			{	
				sum+=1.0*Room[i].J*(1.0*M/Room[i].F);
				M-=M;//记得减掉剩余的M，不然会循环第二遍 
			}
		}
		printf("%.3f\n",sum);
	}
	return 0;
}