1048: 采药2

点击打开链接http://sdnuacm.sinaapp.com/problem.php?id=1048

#include<iostream>#include<cstdio>using namespace std;int main(){int m,n,w,v;int max=0;int f[1005]={0};scanf("%d%d",&m,&n);for(int i=1;i<=n;i++){scanf("%d%d",&w,&v);for(int j=w;j<=m;j++){if(f[j]<f[j-w]+v)f[j]=f[j-w]+v;}}printf("%d",f[m]);return 0;}