LittleSheep/Algorithm
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

✅ 完全背包问题模版

Browse Source
This commit is contained in:
LittleSheep 2024-05-01 15:00:15 +08:00
parent c648a9cabb
commit 63e337e067
1 changed files with 19 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
complete-backup/main.cc Normal file
View File

@ -0,0 +1,19 @@
#include <cstring>
#include <iostream>
using namespace std;
#define MAXN 10005
#define M 105
int dp[MAXN];
int w[M], v[M];
int x[M];
int main() {
int n, W;
cin >> W >> n;
for (int i = 1; i <= n; i++)
cin >> w[i] >> v[i];
for (int i = 1; i <= n; i++)
for (int j = w[i]; j <= W; j++)
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
cout << dp[W] << endl;
return 0;
}