51nod 1085 01背包模板

#include <iostream>
#include <cstring>
#include <cmath>
#include <string>
#include<cstring>
using namespace std;

int const maxn = 10005;
int w[maxn],c[maxn], f[maxn];

int main()
{
int n,v;
while(cin>>n>>v)
{
for ( int i = 1;i <= n;i++)
{
cin>>c[i]>>w[i];
}
memset(f,0,sizeof(f));
//不要求把背包装满，总价值尽可能大就行
/*
f[0]=0;
for (int i = 1;i < 1001;i++)
{
f[i]=-1000000;
}
*/
//要求恰好把背包装满
for (int i = 1;i <= n;i++)
{
for ( int j = v;j >= c[i];j--)
{
f[j]=max(f[j],f[j-c[i]]+w[i]);
}
}
cout<<f[v]<<endl;
}
return 0;
}