01背包（模板题） 之 poj 3624

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX = 3410, max_w = 12885;
int N, M;
int W[MAX], D[MAX], dp[max_w];

int Solve() {
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= N; ++i) {
for (int j = M; j >= W[i]; --j) {
dp[j] = max(dp[j], dp[j - W[i]] + D[i]);
}
}
return dp[M];
}

int main() {
//freopen("input.txt", "r", stdin);
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; ++i) {
scanf("%d %d", &W[i], &D[i]);
}
printf("%d\n", Solve());
return 0;
}