HDU 2546 饭卡（01背包小变形）

#include <stdio.h>
#include <string.h>
#define N 1005
#define max(a,b) a > b ? a : b
int V,dp
;
void Bag_01(int c,int w)
{
    for(int i=V-5;i>=c;i--)
        dp[i] = max(dp[i],dp[i-c]+w);
}
int main()
{
    int n,w
,mmax,loc;
    while(scanf("%d",&n),n)
    {
        mmax = loc = 0;
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&w[i]);
            if(mmax < w[i])
                mmax = w[i] , loc = i;
        }
        w[loc] = w
 , w
 = mmax;
        scanf("%d",&V);
        if(V < 5)
            printf("%d\n",V);
        else
        {
            for(int i=1;i<=n-1;i++)
                Bag_01(w[i],w[i]);
            printf("%d\n",V-dp[V-5]-w
);
        }
    }
    return 0;
}