P3093 [USACO13DEC]牛奶调度Milk Scheduling

    • 150通过
    • 305提交
  • 题目提供者FarmerJohn2
  • 标签 枚举,暴力 贪心 USACO 2013 高性能
  • 难度 普及/提高-
  • 时空限制 1s / 128MB

题解

  • 提示:收藏到任务计划后,可在首页查看。
  • 推荐的相关题目

    题目描述

    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 gallons of milk Farmer John can obtain.

    输入输出样例

    输入样例#1: 复制
    4 
    10 3 
    7 5 
    8 1 
    2 1 
    
    输出样例#1: 复制
    25 
    

    说明

    There are 4 cows. The first produces 10 gallons of milk if milked by time 3, and so on.

    Farmer John milks cow 3 first, giving up on cow 4 since she cannot be milked by her deadline due to the conflict with cow 3. Farmer John then milks cows 1 and 2.

    提示
    标程仅供做题后或实在无思路时参考。
    请自觉、自律地使用该功能并请对自己的学习负责。
    如果发现恶意抄袭标程,将按照I类违反进行处理。