PAT (Advanced) 1070. Mooncake (25)

hale1007

于 2014-03-04 12:59:13 发布

阅读量735

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/hale1007/article/details/20455225

PAT 专栏收录该内容

41 篇文章

订阅专栏

本文介绍了一种基于成本性能比（CP）的算法，用于优化月饼采购过程，通过排序和累加成本性能最高的月饼，实现最优的采购策略。此算法能够帮助决策者在预算限制下最大化采购价值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>

using namespace std;

const int MAX = 1010;

struct Mooncake
{
	double inventory;
	double price;
	double cp;		// cost performance
	bool operator < (const Mooncake &a) const
	{
		return cp > a.cp;
	}
}mooncake[MAX];



int main()
{
	int N, D;
	cin >> N >> D;
	for (int i = 0; i < N; i++)
		cin >> mooncake[i].inventory;
	for (int i = 0; i < N; i++)
		cin >> mooncake[i].price;
	for (int i = 0; i < N; i++)
		mooncake[i].cp = mooncake[i].price / mooncake[i].inventory;
	sort(mooncake, mooncake + N);
	
	double sum = 0;
	int i = 0;
	while (D > 0 && i <= N)
	{
		int v;
		if (D <= mooncake[i].inventory)
			v = D;
		else
			v = mooncake[i].inventory;
		sum += v * mooncake[i].cp;
		D -= v;
		i++;
	}
	cout << fixed << setprecision(2) << sum << endl;

	return 0;
}