Bookshelf 2 -- 动态规划01背包稍作改变

#include <cstdio>
#include <cstring>
#include <algorithm>


using namespace std;
int cow[25];
int value[25];
int height[1000000];
int bad[1000000];
int main()
{
int sum=0;
int n,m;
int count=0;
scanf("%d %d",&n,&m);
memset(bad,0,sizeof(bad));
for(int i = 1;i<=n;i++)
{
scanf("%d",&cow[i]);
value[i] = cow[i];
sum += value[i];
}

for(int i = 1;i<=n;i++)
{
for(int j =sum;j>=cow[i];j--)
{
height[j] = max(height[j-cow[i]]+value[i],height[j]);
}
}
for(int i = 0;i<=sum;i++)
{
if(height[i]>=m)
{
printf("%d",height[i]-m);
break;
}
}

}