模板题,倒着for,复杂度O(n*maxV)。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int c[502],v[502];
int n,m;
int f[100004];
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=(x<<3)+(x<<1)+c-'0',c=getchar();
return x;
}
int main() {
n=read(),m=read();
for (register int i=1;i<=n;++i) {
scanf("%d%d",&c[i],&v[i]);
for (int j=m;j>=c[i];--j)
f[j]=max(f[j],f[j-c[i]]+v[i]);
}
printf("%d\n",f[m]);
return 0;
}