AcWing 2. 01背包问题
原题链接
简单
作者:
夜半钟声
,
2020-11-22 19:01:40
,
所有人可见
,
阅读 407
C++ 代码
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 1010;
int n, m;
int f[N][N];
int 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++) {
f[i][j] = f[i - 1][j]; // 第i件物品不选
if (j >= v[i]) {
f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]); // 第i件物品选
}
}
int res = 0;
for (int j = 0; j <= m; j++) res = max(res, f[n][j]);
cout << res << endl;
return 0;
}