hiho 第六周 01背包

简单的01背包，没有报名，这周的没有权限提交

#include<iostream>
#include<memory.h>
using namespace std;
#define maxn 505
#define maxm 100005
int need[maxn],value[maxn];
int dp[maxm];
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        memset(dp,0,sizeof(dp));
        for(int i = 1; i <= n; i++)
            cin>>need[i]>>value[i];
        for(int j = 0; j <= m; j++)
            dp[j] = 0;
        for(int i = 1; i <= n; i++)
            for(int j = m; j >= need[i]; j--)
                dp[j] = max(dp[j],dp[j - need[i]] + value[i]);
        cout<<dp[m]<<endl;
    }
    return 0;
}