HDU-5188zhx and contest（贪心+背包）

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int mac=1e5+10;

long long dp[mac*30];
struct node
{
    int t,v,l;
    bool operator<(const node&a)const {
        return l-t<a.l-a.t;//越充分利用时间越优，浪费时间的后选
    }
}a[50];

int main()
{
    int n,w;
    while (~scanf ("%d%d",&n,&w)){
        memset(dp,0,sizeof dp);
        int s=0,ss=0;
        for (int i=0; i<50; i++)
            a[i].t=a[i].v=a[i].l=0;
        long long pt=0;
        for (int i=1; i<=n; i++){
            int t,v,l;
            scanf ("%d%d%d",&t,&v,&l);
            a[i]=node{t,v,l};
            pt+=v;
            s+=a[i].t;ss=max(a[i].l,ss);
        }
        if (pt<w) {printf("zhx is naive!\n"); continue;}
        int tot=max(s,ss)+10;
        sort(a+1,a+1+n);
        for (int i=1; i<=n; i++){
            for (int j=tot; j>=max(a[i].t,a[i].l); j--){
                dp[j]=max(dp[j],dp[j-a[i].t]+a[i].v);
            }
        }
        for (int i=0; i<=tot; i++)
            if (dp[i]>=w) {
                printf("%d\n",i);
                break;
            }
    }

    return 0;
}