2134 Problem E FatMouse’s Trade

问题 E: FatMouse's Trade

时间限制: 1 Sec  内存限制: 32 MB
提交: 144  解决: 83
[提交][状态][讨论版][命题人:外部导入]

题目描述

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<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

struct Trade {
	double cat;
	double java;
	double value;
}t[1050];

bool cmp(Trade a, Trade b) {
	return a.value > b.value;
}

int main() {
	double M;
	int N;
	while (cin >> M >> N&&M != -1 && N != -1) {
		for (int i = 0; i < N; i++) {
			cin >> t[i].java >> t[i].cat;
			t[i].value = t[i].java / t[i].cat;
		}
		sort(t, t + N, cmp);
		double obt = 0;
		int num = 0;
		while (M - t[num].cat > 0) {
			M -= t[num].cat;
			obt += t[num++].java;
		}
		obt += M*t[num].value;
		printf("%.3f\n", obt);
	}
	return 0;
}