bzoj1625

裸背包。。

#include<cstdio>#include<algorithm>#include<cstring>#include<math.h>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fd(i,a,b) for(int i=a;i>=b;i--)using namespace std;int n,m;int f[100005];int w[100000],v[100005];int main(){    scanf("%d%d",&n,&m);    fo(i,1,n)    {        scanf("%d%d",&w[i],&v[i]);    }    fo(i,1,n)    fd(j,m,w[i])    f[j]=max(f[j],f[j-w[i]]+v[i]);    printf("%d\n",f[m]);}