NEC Programming Contest 2021(AtCoder Beginner Contest 229) C - Cheese

最新推荐文章于 2024-09-11 11:31:11 发布

Evil_boy__

最新推荐文章于 2024-09-11 11:31:11 发布

阅读量838

点赞数

文章标签： c++ c语言

本文链接：https://blog.csdn.net/m0_55682843/article/details/121585390

版权

在NEC Programming Contest 2021的AtCoder Beginner Contest 229中，问题C - Cheese涉及制作美味的奶酪比萨。程序员需要在不超过W克的限制下，从N种不同美味值的奶酪中选择，使得比萨的总美味值最大化。每种奶酪都有其固定美味值(Ai)和可用量(Bi)。通过排序和贪心策略，可以找出最佳的奶酪组合以达到最大美味值。

摘要由CSDN通过智能技术生成

题目链接：C - Cheese (atcoder.jp)

Problem Statement

Takahashi, who works for a pizza restaurant, is making a delicious cheese pizza for staff meals.
There are N kinds of cheese in front of him.
The deliciousness of the i-th kind of cheese is Ai per gram, and Bi grams of this cheese are available.
The deliciousness of the pizza will be the total deliciousness of cheese he puts on top of the pizza.
However, using too much cheese would make his boss angry, so the pizza can have at most W grams of cheese on top of it.
Under this condition, find the maximum possible deliciousness of the pizza.