题目链接
题目思路
其实多重背包就是0-1背包的变种,状态转移方程如下
#include <iostream>
#include<string.h>
using namespace std;
int solve(int *need,int*value,int n,int m)
{
int result;
int *dp=new int[m+1];
memset(dp,0,m*sizeof(int));
for(int i=0;i<n;i++)
{
for(int j=need[i];j<=m;j++)
{
dp[j]=max(dp[j],dp[j-need[i]]+value[i]);
}
}
result = dp[m];
delete[]dp;
return result;
}
int main()
{
int n,m;
cin>>n>>m;
int *need = new int[n];
int *value = new int[n];
for(int i=0;i<n;i++)
{
cin>>need[i]>>value[i];
}
cout<<solve(need,value,n,m);
delete[]need;
delete[]value;
return 0;
}