【HDOJ】3466 Proud Merchants

先排序预处理，后01背包。

 #include <stdio.h>
 #include <string.h>
 #include <stdlib.h>

 #define MAX(a, b) (a>b) ? a:b

 int dp[];

 typedef struct {
     int p, q, v;
 } stuff_st;

 stuff_st stuffs[];

 int comp(const void *a, const void *b) {
     stuff_st *p = (stuff_st *)a;
     stuff_st *q = (stuff_st *)b;

     return (p->q-p->p) - (q->q-q->p);
 }

 int main() {
     int n, m;
     int i, j;

     while (scanf("%d %d", &n, &m) != EOF) {
         for (i=; i<=n; ++i) {
             scanf("%d%d%d", &stuffs[i].p, &stuffs[i].q, &stuffs[i].v);
         }
         memset(dp, , sizeof(dp));
         qsort(stuffs+, n, sizeof(stuff_st), comp);
         for (i=; i<=n; ++i) {
             for (j=m; j>=stuffs[i].q; --j) {
                 dp[j] = MAX(dp[j], dp[j-stuffs[i].p]+stuffs[i].v);
             }
             /*
             for (j=0; j<=m; ++j) {
                 printf("%d ", dp[j]);
             }
             printf("\n");
             */
         }
         printf("%d\n", dp[m]);
     }

     return ;
 }