HDU1009.FatMouse' Trade(贪心）

FatMouse’ Trade

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 102206 Accepted Submission(s): 35663

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

大意：意思就是老鼠用猫食物换取自己最喜爱的食物javaBean的过程，当然换取的最终结果是保证最后的JavaBean是最多的，而且是当自己手中的猫食物小于每个仓库所需交换的猫食物时候，可以手中有多少就交换多少。所以在解这道题时候要想到按照每个仓库javaBean最大的比率排序才能保证最后的交换的javaBean是最大的。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
const int maxx = 1e5 + 10;
using namespace std;
int n, m;
struct node{
	double x, y;
	double z;
}k[maxx];
int cmp(node x, node y){
	return x.z > y.z;
}
int main(){
	while (cin >> n >> m){
		if (n == -1 && m == -1)
			break;
		for (int i = 1; i <= m; i++){
			cin >> k[i].x >> k[i].y;
			k[i].z= k[i].x / k[i].y;
		}
		sort(k + 1, k + m + 1, cmp);
		int t = 1;double sum = 0;
		for (int i = 1; i <= m; i++){
			if (n >= k[i].y)
				sum += k[i].x, n -= k[i].y;
			else {
				sum += n / k[i].y*k[i].x;
				break;
			}
			if (n <= 0) break;
		}
		printf("%.3lf\n", sum);
	}
	return 0;
}