![bzoj 1606: [Usaco2008 Dec]Hay For Sale 购买干草 bzoj 1606: [Usaco2008 Dec]Hay For Sale 购买干草](https://image.shishitao.com:8440/aHR0cHM6Ly9ia3FzaW1nLmlrYWZhbi5jb20vdXBsb2FkL2NoYXRncHQtcy5wbmc%2FIQ%3D%3D.png?!?w=700&webp=1)
Description
约翰遭受了重大的损失:蟑螂吃掉了他所有的干草,留下一群饥饿的牛.他乘着容量为C(1≤C≤50000)个单位的马车,去顿因家买一些干草. 顿因有H(1≤H≤5000)包干草,每一包都有它的体积Vi(l≤Vi≤C).约翰只能整包购买,
他最多可以运回多少体积的干草呢?
Input
第1行输入C和H,之后H行一行输入一个Vi.
Output
最多的可买干草体积.
Sample Input
7 3 //总体积为7,用3个物品来背包
2
6
5
2
6
5
The wagon holds 7 volumetric units; three bales are offered for sale with
volumes of 2, 6, and 5 units, respectively.
Sample Output
7 //最大可以背出来的体积
HINT
Buying the two smaller bales fills the wagon.
Source
http://www.lydsy.com/JudgeOnline/problem.php?id=1606
01背包
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main(){
int m,n; scanf("%d%d",&m,&n);
int f[]={false};
f[]=true;
for (int i=;i<=n;i++){
int a; scanf("%d",&a);
for (int j=m;j>=a;j--)
if (f[j-a]) f[j]=true;
}
for (int i=m;i>=;i--)
if (f[i]) {
printf("%d",i);
break;
}
return ;
}