一波水题 MZOJ 1035: 贝克汉姆

#include <bits/stdc++.h>
using namespace std;
 
const int N = 5005;
 
int n,m;
int v[N],w[N],f[N];
 
int main()
{
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n; i++)
    scanf("%d%d",&v[i],&w[i]);
    for(int i = 1;i <= n; i++)
        for(int j = m; j >= v[i]; j--)
            f[j] = max(f[j],f[j - v[i]] + w[i]);
    printf("%d",f[m]);
    return 0;
}