[AcWing 1024] 装箱问题

---

点击查看代码

#include<iostream>

using namespace std;

const int N = 20010;

int m, n;
int v[N], f[N];

int main()
{
	cin >> m >> n;
	for (int i = 1; i <= n; i ++)	cin >> v[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]] + v[i]);
	cout << m - f[m] << endl;
	return 0;
}

---

1. 经典 0-1 背包模型
   价值就是这里的体积