hdu5188 01 背包

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn =30+5;
typedef long long LL;
struct point{
  int t,v,L,x;
  bool operator <(const point &rhs)const{
      if(x!=rhs.x) return x<rhs.x;
      return L<rhs.L;
  }
}P[maxn];
LL dp[400005];
int main()
{
    int n,w;
    while(scanf("%d%d",&n,&w)==2){
         LL sum1=0;
         int sumt=0,ub=0;
         for(int i =0; i<n; i++){
             scanf("%d%d%d",&P[i].t,&P[i].v,&P[i].L);
              ub = max(P[i].L,ub);
              sum1+=P[i].v;
              sumt+=P[i].t;
              P[i].x=P[i].L-P[i].t;
         }
         if(sum1<w){
             printf("zhx is naive!\n");continue;
         }
         sort(P,P+n);
          ub = sumt+ub;
         memset(dp,0,sizeof(dp));
         for(int i=0; i<n; ++i)
            for(int j=ub; j>=P[i].L&&j>=P[i].t; j--)
             dp[j] = max(dp[j],dp[j-P[i].t]+P[i].v);
         int ans=ub+1;
         for(int i =0; i<=ub; i++)
         if(dp[i]>=w){
             ans=i; break;
         }
         if(ans == ub+1){
             printf("zhx is naive!\n");continue;
         }else printf("%d\n",ans);
    }
    return 0;
}