Algorithm/complete-backup/main.cc
2024-05-01 15:00:15 +08:00

20 lines
384 B
C++

#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;
}