2024-09-19 02:22:41 +00:00
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
|
|
|
|
const int maxm = 201, maxn = 31;
|
|
|
|
|
|
int m, n;
|
|
|
|
|
|
int w[maxn], c[maxn];
|
|
|
|
|
|
int f[maxn][maxm];
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
10 4
|
|
|
|
|
|
2 1
|
|
|
|
|
|
3 3
|
|
|
|
|
|
4 5
|
|
|
|
|
|
7 9
|
|
|
|
|
|
*/
|
|
|
|
|
|
int main(){
|
|
|
|
|
|
ios::sync_with_stdio(false);
|
|
|
|
|
|
cin.tie(0);
|
|
|
|
|
|
|
2024-09-19 03:11:59 +00:00
|
|
|
|
cin>>m>>n; //背包容量m和物品数量n
|
|
|
|
|
|
for (int i = 1; i <= n; i++) //在初始化循环变量部分，定义一个变量并初始化
|
|
|
|
|
|
cin>>w[i]>>c[i]; //每个物品的重量和价值
|
|
|
|
|
|
for (int i = 1; i <= n; i++) // f[i][v]表示前i件物品，总重量不超过v的最优价值
|
2024-09-19 02:22:41 +00:00
|
|
|
|
for (int v = m; v > 0; v--)
|
|
|
|
|
|
if (w[i] <= v)
|
|
|
|
|
|
f[i][v] = max(f[i-1][v],f[i-1][v-w[i]]+c[i]);
|
|
|
|
|
|
else
|
|
|
|
|
|
f[i][v] = f[i-1][v];
|
2024-09-19 03:11:59 +00:00
|
|
|
|
cout<<f[n][m]<<endl; // f[n][m]为最优解
|
2024-09-19 02:22:41 +00:00
|
|
|
|
return 0;
|
|
|
|
|
|
}
|
|
|
|
|
|
|
