01背包 || BZOJ 1606: [Usaco2008 Dec]Hay For Sale 购买干草 || Luogu P2925 [USACO08DEC]干草出售Hay For Sale

题面：P2925 [USACO08DEC]干草出售Hay For Sale

题解：无

代码：

 #include<cstdio>
 #include<cstring>
 #include<iostream>
 using namespace std;
 const int maxc=,maxh=;
 int C,H,V[maxh];
 bool F[maxc];
 int main(){
     scanf("%d%d",&C,&H);
     for(int i=;i<=H;i++)scanf("%d",&V[i]);
     F[]=;
     for(int i=;i<=H;i++)
         for(int j=C;j>=V[i];j--)
             if(F[j-V[i]])F[j]=;
     for(int i=C;i>=;i--)
         if(F[i]){
             printf("%d\n",i);
             return ;
         }
 }

---

By:AlenaNuna