模板-01背包

#include <iostream>
#include <cstring>
using namespace std;
const int MAXC=10001;

int main()
{
    int C[MAXC],W[MAXC];
    int f[MAXC];
    int n,V;
    cin>>n>>V;
    memset(f,0,sizeof(f));
    for(int i = 1; i <= n; i++)
    {
        cin>>C[i]>>W[i];
        for(int j=V;j>=C[i];j--)
        {
                if(f[j]<f[j-C[i]]+W[i])
                f[j]=f[j-C[i]]+W[i];
        }
    }
    cout<<f[V];
  return 0;
}