POJ_3624 Charm Bracelet ( 01背包 )

#include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

const int N = 12888;
const int M = 3407;

int f
;
int w[M];
int v[M];

int main() {
//freopen("data.in", "r", stdin);

int n, V, i, j;
while(~scanf("%d%d", &n, &V)) {
for(i = 0; i < n; i++) {
scanf("%d%d", &w[i], &v[i]);
}
memset(f, 0, sizeof(f));
for(i = 0; i < n; i++) {
for(j = V; j >= w[i]; j--) {
f[j] = max(f[j], f[j-w[i]] + v[i]);
}
}
cout << f[V] << endl;
}
return 0;
}