hdu3466 Proud Merchants

#include<iostream>#include<string.h>#include<algorithm>using namespace std;struct Node{    int p;    int q;    int v;}d[5005];int cmp(Node a,Node b){    return a.q-a.p<b.q-b.p;}int main(){    int n,m,i,j;    int f[5005];    while(cin>>n>>m)    {        memset(f,0,sizeof(f));        for(i=1;i<=n;i++)        cin>>d[i].p>>d[i].q>>d[i].v;        sort(d+1,d+1+n,cmp);        for(i=1;i<=n;i++)        for(j=m;j>=d[i].q;j--)        {            int a=f[j];            int b=f[j-d[i].p]+d[i].v;            f[j]=a>b?a:b;        }        cout<<f[m]<<endl;    }    return 0;}