# HDU - 1114 Piggy-Bank 【完全背包】

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

pi wi
pi 表示 第i件货币的价值
wi 表示第i件货币的重量

dp[0] = 0

AC代码

#include <cstdio>
#include <cstring>
#include <ctype.h>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <set>
#include <list>
#include <numeric>
#include <sstream>
#include <iomanip>
#include <limits>

#define CLR(a, b) memset(a, (b), sizeof(a))
#define pb push_back

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair<string, int> psi;
typedef pair<string, string> pss;
typedef pair<int, ll> pil;

const double PI = acos(-1.0);
const double E = exp(1.0);
const double eps = 1e-8;

const int INF = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;

int dp[maxn];
int v[505], w[505];

void init()
{
CLR(dp, 0x3f);
dp[0] = 0;
}

int main()
{
int t;
cin >> t;
while (t--)
{
int a, b;
scanf("%d%d", &a, &b);
int weight = b - a;
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &v[i], &w[i]);
init();
for (int i = 1; i <= n; i++)
for (int j = w[i]; j <= weight; j++)
dp[j] = min(dp[j], dp[j - w[i]] + v[i]);
if (dp[weight] == INF)
printf("This is impossible.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n", dp[weight]);
}
}



• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120