hdu2546 0-1背包 饭卡

http://www.cnblogs.com/gt123/p/3461195.html

#include<iostream>
#include<stack>
#include<queue>
#include<cstdio>
#include<cstring>
#include<string> 
#include<cstdlib>
#include<algorithm>
using namespace std;
const int LEN=1005; 
int p[LEN], w[LEN*50];
int main(int argc, char *argv[])
{
	int i, j, bal, n;
	while( cin>>n && n )
	{
		for(i=0; i<n; i++)
		{
			scanf("%d", &p[i]);
		}
		cin>>bal;
		memset(w, 0, sizeof w);
		sort(p, p+n);
		for(i=0; i<n-1; i++)
		{
			for(j=bal-5; j>=p[i]; j--)
			{
				w[j]=max(w[j-p[i]]+p[i], w[j]);
			}
		}
		cout<<( bal>=5 ? bal-w[bal-5]-p[n-1] : bal )<<endl;
	}
	return 0;
}