01背包问题
作者:
blossomsym
,
2023-05-29 21:21:21
,
所有人可见
,
阅读 103
#include<bits/stdc++.h>
#include<string>
#include<string.h>
#include<algorithm>
#define ll long long
using namespace std;
const int N = 1005;
int n, m;
int v[N], w[N],f[N][N];
int main() {
cin >> n >> m;//物品数量 背包容积
for (int i = 0; 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];
if (j >= v[i]) {
f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]);
}
}
}
cout << f[n][m] << endl;
return 0;
}