PAT 甲级 1070 Mooncake

题意：给定一些月饼的库存和总的销售额，问如何销售才能获得最大的利润

思路：输入库存和总的销售额，然后算出每种月饼的单价，对每种月饼的单价进行从高到低排序，然后依次遍历每种月饼，求出最大销售额。

代码：

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
struct node {
	double inven, profit, price;//总销售额，单价
};
bool com(node a, node b) { return a.price > b.price; }
int main() {
	int n, need;
	cin >> n >> need;
	vector<node> v(n);
	for (int i = 0; i < n; i++)scanf("%lf",&v[i].inven);
	for (int i = 0; i < n; i++) {
		scanf("%lf", &v[i].profit);
		v[i].price = v[i].profit / v[i].inven;
	}
	sort(v.begin(), v.end(), com);
	double sum = 0;
	for (int i = 0; i < v.size() && need > 0; i++) {
		if (need >= v[i].inven) {
			sum += v[i].profit;
			need -= v[i].inven;
		}
		else {
			sum = sum + (v[i].profit*need) / v[i].inven;
			need = 0;
			break;
		}
	}
	printf("%.2lf",sum);
	system("pause");
	return 0;
}