Piggy-Bank 背包

Piggy-Bank
原题链接https://vjudge.net/contest/348156#problem/N

完全背包求最小值 将max函数换为min即可。

#include<cstring>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
long long dp[100005];
int main()
{
	long long t;
	scanf("%lld",&t);
	while(t--)
	{
		long long e,f;
		scanf("%lld %lld",&e,&f);
		long long jia[50005];
		long long zh[50005];
		long long dp[50005];
		memset(jia,0,sizeof(jia));
		memset(zh,0,sizeof(zh));
		memset(dp,1008610086,sizeof(dp));
		long long n;
		scanf("%lld",&n);
		long long i,j;
		dp[0]=0;
		for(i=1; i<=n; i++)
		{
			scanf("%lld %lld",&jia[i],&zh[i]);
		}
		for(i=1; i<=n; i++)
		{
			for(j=zh[i]; j<=f-e; j++)
			{
				dp[j]=min(dp[j],dp[j-zh[i]]+jia[i]);
			}
		}
		if(dp[f-e]!=2748926567846913574)
		{
			printf("The minimum amount of money in the piggy-bank is %lld.\n",dp[f-e]);
		}
		else
		{
			printf("This is impossible.\n");
		}
	}
	return 0;
}