bzoj4096 [Usaco2013 dec]Milk Scheduling

Description

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. 

 

 

 

Input

* Line 1: The value of N. 

* Lines 2..1+N: Line i+1 contains the integers g_i and d_i.

 

Output

* Line 1: The maximum number of gallons of milk Farmer John can obtain.

 

Sample Input

4
10 3
7 5
8 1
2 1
INPUT DETAILS: There are 4 cows. The first produces 10 gallons of milk if milked by time 3, and so on.

Sample Output

25
OUTPUT DETAILS: 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.

 

 

倒序加入堆里，每次取出个价值最大的

#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#include<cstdlib>
using namespace std;
priority_queue<int> q;
int n,tm,num,ans;
struct dat{int c,w;}a[100100];
bool operator <(const dat &a,const dat &b){return a.c>b.c;}
int main()
{
    q.empty();
    scanf("%d",&n);
    for (int i=1;i<=n;i++)scanf("%d%d",&a[i].w,&a[i].c);
    sort(a+1,a+n+1);
    tm=a[1].c;q.push(a[1].w);num=1;
    a[n+1].w=0;a[n+1].c=0;
    for (int i=2;i<=n+1;i++)
    {
        int go=min(tm-a[i].c,num);
        while (go!=0)ans+=q.top(),q.pop(),num--,go--;
        q.push(a[i].w);num++;tm=a[i].c;
    }
    printf("%d\n",ans);
}