poj 3624 01 背包

#include <iostream>#include <cstdio>#include <cstring>using namespace std;int dp[13000], v[4000], jz[4000];int n, m;void onetwopack(int v, int c){    for(int i = m; i >= v; i--)        dp[i] = max(dp[i], dp[i-v]+c);}int main(){    while(cin >> n >> m)    {        for(int i = 0; i < n; i++) cin >> v[i] >> jz[i];        memset(dp, 0, sizeof(dp));        for(int i = 0; i < n; i++)            onetwopack(v[i], jz[i]);        printf("%d\n", dp[m]);    }}