AcWing 3. 完全背包问题
原题链接
简单
作者:
yokeriz
,
2024-04-23 20:22:58
,
所有人可见
,
阅读 5
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e3 + 10;
int n, m;
int dp[N], v[N], w[N];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n ; i ++ )
cin >> v[i] >> w[i];
// for(int i = 1; i <= n; i ++ )
// for(int j = 0; j <= m; j ++ )
// for(int k = 0; k * v[i] <= j; k ++ )
// dp[i][j] = max(dp[i][j], dp[i - 1][j - k * v[i]] + k * w[i]);
for(int i = 1; i <= n; i ++ )
for(int j = v[i]; j <= m; j ++)
dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
cout << dp[m] << endl;
return 0;
}