类似bzoj1572的处理。按截止时间从小到大排序排序。能做就做,不能做就去换一个已经做过的耗时最长的,使当前时间最优。所以维护一个已经做过的耗时的大根堆。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 150010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();}
while(ch<='9'&&ch>='0') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,ans=0;
struct node{
int tim,ddl;
}a[N];
priority_queue<int,vector<int>,less<int> >q;
inline bool cmp(node a,node b){return a.ddl==b.ddl?a.tim<b.tim:a.ddl<b.ddl;}
int main(){
// freopen("a.in","r",stdin);
n=read();
for(int i=1;i<=n;++i) a[i].tim=read(),a[i].ddl=read();
sort(a+1,a+n+1,cmp);int now=0;
for(int i=1;i<=n;++i){
if(now+a[i].tim<=a[i].ddl) now+=a[i].tim,++ans,q.push(a[i].tim);
else if(a[i].tim<q.top()) now-=q.top()-a[i].tim,q.pop(),q.push(a[i].tim);
}printf("%d\n",ans);
return 0;
}