hdoj 3466 Proud Merchants(01背包)

#include <stdio.h>
#include <string.h>
#include <algorithm>
const int maxn = 505;
using namespace std;

int dp[5005];
struct node
{
    int p, q, v;
}a[maxn];

int cmp(node x, node y)
{
    return x.q - x.p < y.q - y.p;
}
int main()
{
    int n, m;
    while (scanf("%d %d", &n, &m) !=EOF)
    {
        for (int i = 1; i <= n; i++)
        {
            scanf("%d %d %d", &a[i].p, &a[i].q, &a[i].v);
        }
        memset(dp, 0, sizeof(dp));
        sort(a, a+n, cmp);
        for (int i = 1; i <= n; i++)
        {
            for (int j = m; j >= a[i].q; j--)
            {
                dp[j] = max(dp[j], dp[j-a[i].p] + a[i].v);
            }
        }
        printf("%d\n",dp[m]);
    }
    return 0;
}