问题 E: FatMouse's Trade

题目链接：http://codeup.cn/problem.php?cid=100000584&pid=4

题目描述
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

代码

#include<stdio.h>
#include<algorithm>
using namespace std;

struct house{
	int j;
	int f;
	double s;						//记录两者的比例
}h[1010];

bool cmp(house a, house b) {
	return a.s > b.s;
}

int main() {
	double m;
	int n;
	while(scanf("%lf%d", &m, &n) != EOF) {
		if(m == -1 && n == -1)
			break;
		for(int i = 0; i < n; i++) {
			scanf("%d%d", &h[i].j, &h[i].f);
			h[i].s = 1.0 * h[i].j / h[i].f;			 //若不乘1.0 会答案错误50
		}
		sort(h, h + n, cmp);
		double sum = 0;
		for(int i = 0; i < n && m > 0; i++) {
			if(m >= h[i].f) {							//剩的猫食够换的
				sum += h[i].j;
				m -= h[i].f;
			}else{										//只能部分换
				sum += (m / h[i].f) * h[i].j;
				m = 0;
			}
		}
		printf("%0.3f\n", sum);
	}
	return 0;
}