[贪心算法] 例6.1 FatMouse' Trade

六 贪心算法

此类算法, 说是算法, 不如说是一种思想, 即每次选择当前最好的, 而不从整体上把握的思想.

题目描述:
  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.
样例输入:
5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1
Sample Output:
13.333
31.500

题目大意: 有 m 元钱, n 种物品; 每种物品有 j 磅, 总价值 f 元, 可以使用 0 到 f 的任意价格购买相应磅的物品, 例如使用0.3f元, 可以购买0.3j 磅物品. 要求输出 m 元钱最多能买到多少磅物品.
解题思路: 将输入的物品, 按性价比排序, 一个一个拿, 直到没有钱.

#include<bits/stdc++.h>
using namespace std;  

struct goods{ //表示可买物品的结构体 
	double j; //该物品总重
	double f; //该物品总价值
	double s; //该物品性价比
	bool operator <(const goods &A) const {//重载小于运算符,确保可用sort函数将数组按照性价比降序排列 
		return s > A.s; 
	} 
}buf[1000];

int main(){
	double m;
	int n;
	while(scanf("%lf%d", &m, &n) != EOF){
		if(m == -1 && n == -1) break;//当 n=-1 且 m=-1时跳出循环,程序运行结束
		for(int i=0; i<n; i++){
			scanf("%lf%lf", &buf[i].j, &buf[i].f);//输入
			buf[i].s = buf[i].j / buf[i].f; // 计算性价比
		} 
		sort(buf, buf+n);//使各物品按性价比降序排列
		int idx = 0; //当前货物下标
		double ans = 0; //累加所能得到的总重量
		while(m>0 && idx < n){//循环条件为, 既有物品剩余(idx < n)还有钱剩余(m>0)时继续循环 
			if(m>buf[idx].f) {
				ans += buf[idx].j;
				m -= buf[idx].f;
			}//若能买下全部该物品
			else{
				ans += buf[idx].j * m / buf[idx].f;
				m = 0;
			} //若只能买下部分该物品
			idx++; //继续下一个物品 
		} 
		printf("%.3lf\n", ans); //输出 
	}
	return 0;
} 

结束

---