2134 Problem E FatMouse's Trade

问题 E: FatMouse’s Trade

时间限制: 1 Sec 内存限制: 32 MB

题目描述

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.

输入

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.

输出

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.

样例输入

4 2
4 7
1 3
5 5
4 8
3 8
1 2
2 5
2 4
-1 -1

样例输出

2.286
2.500

经验总结

计算每个房间的回报率， 然后从回报率最好的房间开始交易，注意运算过程中的浮点数。

AC代码

#include <cstdio>
#include <algorithm>
using namespace std;
struct trade
{
	int f; 
	int j;
	double p;
}tra[1010];
bool cmp(trade a, trade b)
{
	return a.p < b.p;
}
int main()
{
	int m, n;
	while(scanf("%d%d", &m, &n) != EOF)
	{
		if(n == -1)   break;
		for(int i = 0; i < n; i++)
		{
			scanf("%d%d", &tra[i].j, &tra[i].f);
			tra[i].p = tra[i].f * 1.0 / tra[i].j;
		}
		sort(tra, tra + n, cmp);
		double sum1 = 0, sum2 = 0;
		int temp = 0;
		for(int i = 0; i < n; i++)
		{
		     sum1 += tra[i].f;
		     sum2 += tra[i].j;
		     if(sum1 > m)
		     {
		     	sum1 -= tra[i].f;
		     	sum2 -= tra[i].j;
		     	temp = m - sum1;
		     	sum2 += temp * 1.0 / tra[i].f * tra[i].j;
		     	break;
		     }
		}
		printf("%.3f\n", sum2);
	}
	return 0;
}