POJ3624 01背包

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int f[13000],c[3500],w[3500];

int main()
{
	int n,m;
	while(cin>>n>>m)
	{
		memset(f,0,sizeof(f));
		memset(c,0,sizeof(c));
		memset(w,0,sizeof(w));
		int i,j;
		for(i=1;i<=n;i++)
		{
			cin>>c[i]>>w[i];
		}
		for(i=1;i<=n;i++)
			for(j=m;j>=c[i];j--)
				f[j]=max(f[j],f[j-c[i]]+w[i]);
		cout<<f[m]<<endl;
	}
	return 0;
}