#include <iostream>
using namespace std;
const int N = 1010;
int v[N], w[N], f[N];
int n, m;
int main()
{
scanf_s("%d%d", &m, &n);
for (int i = 1; i <= n; i++) scanf_s("%d%d", &v[i], &w[i]);
for (int i = 1; i <= n; i++)
for (int j = m; j >= v[i]; j--)
{
f[j] = max(f[j], f[j - v[i]] + w[i]);
}
printf("%d", f[m]);
return 0;
}
算法分析-01背包,动态规划
最新推荐文章于 2024-10-04 17:07:53 发布