01 Backpack-poj3628__ Dynamic Planning

Typical 01 backpack.

Q: Tell you the height of all cows and the height of the shed, ask the minimum difference how much.

Just start to read the wrong title, WA a lot of times, I think is the height of cattle can not exceed B, can be the original title is said to exceed the minimum height, sad reminders.

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
Long long high[25];
Long long f[1000050];
int main ()
{
    int n;
    Long long H;
    Long long sum;
    while (cin>>n>>h)
    {

        sum=0;
        for (int i=1; i<=n; i++)
        {
            cin>>high[i];
            Sum+=high[i];
        }
        memset (F,0,sizeof (f));
        for (int i=1; i<=n; i++) for
            (Long long j=sum; j>=high[i]; j--)

                F[j]=max (f[j],f[j-high[i]]+high[i));
        for (int i=1; i<=sum; ++i)
            if (f[i]>=h)
            {
                cout<<f[i]-h<<endl;
                break;
            }
    }
    return 0;
}