baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-27 16:16:25 +00:00
Code Releases Activity

3. 完全背包问题

Browse Source 
https://www.acwing.com/problem/content/submission/code_detail/7086776/
This commit is contained in:
Baoshuo Ren 2021-08-12 20:46:16 +08:00 committed by Baoshuo Ren
parent 2c2a273527
commit 2fa8305968
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 19 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
AcWing/3/3.cpp Normal file
View File

@ -0,0 +1,19 @@
#include <bits/stdc++.h>
using namespace std;
int n, m, v[1005], w[1005], f[1005][1005];
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] = max(f[i - 1][j], j >= v[i] ? f[i][j - v[i]] + w[i] : f[i - 1][j]);
}
}
cout << f[n][m] << endl;
return 0;
}