poj3624 Charm Bracelet（01背包）

好歹是自己做的01背包，纪念下= =

#include <stdio.h>#include <algorithm>#include <iostream>#include <cmath>#include <string.h>using namespace std;const int N = 50005;int dp[N], vol[N], val[N];int main(){   // freopen("in.txt", "r", stdin);    int n, m;    double q0, qq;    while(~scanf("%d%d", &n, &m))    {        memset(dp, 0, sizeof(dp));        for(int i = 0; i < n; i ++)        {            scanf("%d%d", &vol[i], &val[i]);        }        for(int i = 0; i < n; i ++)            for(int j = m; j >= vol[i]; j --)                dp[j] = max(dp[j], dp[j - vol[i]] + val[i]);        printf("%d\n", dp[m]);    }    return 0;}