【洛谷 3093】[USACO13DEC]牛奶调度Milk Scheduling

最新推荐文章于 2024-01-01 14:09:41 发布

LOI_Sherlock

最新推荐文章于 2024-01-01 14:09:41 发布

阅读量651

点赞数 1

CC 4.0 BY-SA版权

分类专栏： ===基础=== 贪心

本文链接：https://blog.youkuaiyun.com/Hall_Of_Fame_/article/details/78474336

在本题中，Farmer John需要为N头奶牛安排最佳挤奶顺序，每头牛有自己的产奶量和截止时间。通过优化挤奶顺序，帮助FJ计算能获得的最大牛奶总量。问题可以通过贪心策略解决，按奶牛的截止时间从小到大排序，依次放入小根堆中，确保最大产奶量优先。

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

题目描述

Farmer John has N cows that need to be milked (1 <= N <= 10,000), each of which takes only one unit of time to milk.

Being impatient animals, some cows will refuse to be milked if Farmer John waits too long to milk them. More specifically, cow i produces g_i gallons of milk (1 <= g_i <= 1000), but only if she is milked before a deadline at time d_i (1 <= d_i <= 10,000). Time starts at t=0, so at most x total cows can be milked prior to a deadline at time t=x.

Please help Farmer John determine the maximum amount of milk that he can obtain if he milks the cows optimally.

FJ有N(1 <= N <= 10,000)头牛要挤牛奶，每头牛需要花费1单位时间。

奶牛很厌烦等待，奶牛i在它的截止时间d_i (1 <= d_i <= 10,000)前挤g(1 <= g_i <= 1000)的奶，否则将不能挤奶。时间t开始时为0，即在时间t=x时，最多可以挤x头奶牛。

请计算FJ的最大挤奶量。

输入输出格式

输入格式：
Line 1: The value of N.

Lines 2..1+N: Line i+1 contains the integers g_i and d_i.
输出格式：
Line 1: The maximum number of gal