#include <iostream> #include <stdio.h> #include <string.h> int max(int a,int b){ return a>b?a:b; } int main(int argc, char *argv[]) { int n,m,i,j; scanf("%d%d",&n,&m); int w[n+1],v[n+1],dp[n+1][m+1]; memset(dp,0,sizeof(int)*(n+1)*(m+1)); for(i=1;i<n+1;i++){ scanf("%d%d",&w[i],&v[i]); } for(i=1;i<n+1;i++){ for(j=1;j<m+1;j++){ if(w[i]>j){ dp[i][j]=dp[i-1][j]; }else{ dp[i][j]=max(dp[i-1][j],dp[i][j-w[i]]+v[i]); } } } printf("max=%d",dp[n][m]); return 0; } 我的简单的动态规划算法求解