洛谷 P1280 尼克的任务

#include <algorithm>
#include <cstdio>
#define N 10005
using namespace std;
struct node
{
    int x,y;
    bool operator<(node a)const
    {
        return x>a.x;
    }
}task[N];
int n,k,f[N],sum[N];
inline int max(int a,int b) {return a>b?a:b;} 
int Main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=k;++i) scanf("%d%d",&task[i].x,&task[i].y),sum[task[i].x]++;
    sort(task+1,task+1+k);
    for(int now=1,i=n;i>=1;--i)
    {
        if(!sum[i]) f[i]=f[i+1]+1;
        for(int j=1;j<=sum[i];++j,++now)
         f[i]=max(f[i],f[i+task[now].y]);
    }
    printf("%d\n",f[1]);
    return 0;
}
int sb=Main();
int main(int argc,char *argv[]) {;}