POJ-1456-Supermarket-超市-（贪心+优先队列）

最新推荐文章于 2019-03-11 17:33:25 发布

原创

最新推荐文章于 2019-03-11 17:33:25 发布 · 803 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#贪心算法 #优先队列 #POJ

该文章介绍了如何使用贪心算法和优先队列解决超市商品销售时间表优化问题，以实现最大利润。通过举例说明了如何根据商品的利润和销售期限进行排序，并利用优先队列选取每天利润最大的商品进行销售，从而找到最佳销售策略。

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

POJ-1456-贪心算法+优先队列

Supermarket

超市

Description

描述

A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes precisely one unit of time for being sold. A selling schedule is an ordered subset of products Sell ≤ Prod such that the selling of each product x∈Sell, according to the ordering of Sell, completes before the deadline dx or just when dx expires. The profit of the selling schedule is Profit(Sell)=Σ_x∈Sellpx. An optimal selling schedule is a schedule with a maximum profit.
For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.