时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：2046

解决：894

//Asimple
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <map>
#include <string>
#include <queue>
#define INF 100000
using namespace std;
const int maxn = 1005;
typedef long long ll;
int m[31][maxn];
int n;
struct bg_typ{int h;int l;int t;bool operator < (const bg_typ& A) const {return A.t > t;}
};
bg_typ bg[31];int main(){while( cin >> n && n >= 0 ){int mmax = 0;for(int i=1; i<=n; i++){cin >> bg[i].h >> bg[i].l >> bg[i].t ;if( bg[i].t > mmax ) mmax = bg[i].t; }sort(bg+1,bg+n+1);for(int i=0; i<=n; i++)m[i][0] = m[0][i] = 0;for(int i=1; i<=n; i++){for(int j=0; j<=mmax; j++){if( j<=bg[i].t && j-bg[i].l>=0){m[i][j] = max(m[i-1][j],m[i-1][j-bg[i].l]+bg[i].h);} else m[i][j] = m[i-1][j];}}int result=m[n][mmax];   for(int j=mmax;j>=0;--j)if(result<m[n][j])  result=m[n][j];   cout<<result<<endl; }return 0;
}

#include <cstdio>
#include <algorithm>  using namespace std;  const int N = 30 + 5;  struct Node
{  int h;  int l;  int t;
};  int n;
Node node[N];
int ans;
int w;  bool cmp(const Node &a, const Node &b);  void dfs(int cur, int t, int h);  int main()
{  #ifndef ONLINE_JUDGE  freopen("e:\\uva_in.txt", "r", stdin);  #endif // ONLINE_JUDGE  while (scanf("%d", &n) == 1) {  if (n < 0)  break;  w = 0;  for (int i = 0; i < n; i++) {  scanf("%d%d%d", &node[i].h, &node[i].l, &node[i].t);  w += node[i].h;  }  sort(node, node + n, cmp);  ans = 0;  dfs(0, 0, 0);  printf("%d\n", ans);  }  return 0;
}  bool cmp(const Node &a, const Node &b)
{  if (a.t != b.t)  return a.t < b.t;  return (double)a.h / a.l > (double)b.h / b.l;
}  void dfs(int cur, int t, int h)
{  if (cur == n) {  if (ans < h)  ans = h;  return;  }  w -= node[cur].h;  if (t + node[cur].l <= node[cur].t) {  dfs(cur + 1, t + node[cur].l, h + node[cur].h);  }  if (h + w > ans)  dfs(cur + 1, t, h);  w += node[cur].h;
}