HDU_3466_动规(01背包)

#include<bits/stdc++.h>
using namespace std;
const int maxn = 500 + 5;
const int maxm = 5000 + 5;
typedef struct node{
int p, q, v;
bool operator< (const node x) const {
return (q-p)<(x.q-x.p);
}
}Node;
Node c[maxn];
int F[maxn][maxm];
int main() {
int n, m;
while(cin >> n >> m) {
for(int i = 1; i <= n; i++) {
cin >> c[i].p >> c[i].q >> c[i].v;
}
sort(c+1, c+n+1);
memset(F, 0, sizeof(F));

for(int i = 1; i<= n; i++) {
for(int j = 0; j <= m; j++) {
F[i][j] = (i ==1 ? 0: F[i-1][j]);
if(j >= c[i].q) F[i][j] = max(F[i][j], F[i-1][j-c[i].p]+c[i].v);
}
}
cout << F
[m] << endl;
}
return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int maxn = 500 + 5;
const int maxm = 5000 + 5;
typedef struct node{
int p, q, v;
bool operator< (const node x) const {
return (q-p)<(x.q-x.p);
}
}Node;
Node c[maxn];
int F[maxm];
int main() {
int n, m;
while(cin >> n >> m) {
for(int i = 1; i <= n; i++) {
cin >> c[i].p >> c[i].q >> c[i].v;
}
sort(c+1, c+n+1);
memset(F, 0, sizeof(F));
for(int i = 1; i<= n; i++) {
for(int j = m; j >= 0; j--) {
F[j] = (i ==1 ? 0: F[j]);
if(j >= c[i].q) F[j] = max(F[j], F[j-c[i].p]+c[i].v);
}
}
cout << F[m] << endl;
}
return 0;
}