HDU 2546 饭卡

http://acm.hdu.edu.cn/showproblem.php?pid=2546

用01背包的思想做的

#include<iostream>
#include "string"
#include "algorithm"
using namespace std;
int dp[1005][1005];
int main()
{
	int n;
	int a[1005];
	int i,j;
	int money;
	int sum;
	while(cin>>n&&n)
	{
		sum=0;
		memset(dp,0,sizeof(dp));
		for(i=1;i<=n;i++){
			cin>>a[i];
			sum+=a[i];
		}
		cin>>money;
		if(money<5)
			cout<<money<<endl;
		else if(sum<=money-5)
		{
			cout<<money-sum<<endl;
		}
		else{
			sort(a+1,a+n+1);
			for(i=1;i<n;i++)
			{
				for(j=0;j<=money-5;j++)
				{
					if(j>=a[i])
						dp[i][j]=dp[i-1][j]>dp[i-1][j-a[i]]+a[i]?dp[i-1][j]:dp[i-1][j-a[i]]+a[i];
					else 
						dp[i][j]=dp[i-1][j];
				}
			}
			cout<<money-dp[n-1][money-5]-a[n]<<endl;
		}
	}
	return 0;
}