POJ1384 完全背包问题

#include <stdio.h>
#include <iostream>
using namespace std;
#define inf 0x3f3f3f3f

int f[5000000];

int min (int a, int b)
{
return a>b ? b : a;
}

void CompletePack (int *f, int c, int w, int v)
{
for(int i = c; i <= v; i++)
f[i] = min (f[i], f[i-c] + w);
}

int main ()
{
int T;
scanf ("%d", &T);
while(T--)
{
int E,F,N,V;
int C[505],W[505]; // C -> Cost , W -> Wealth
int i,j,k;
scanf ("%d%d", &E, &F);
V = F - E;
scanf ("%d", &N);
for(i = 0; i < N; i++)
scanf ("%d%d", &W[i], &C[i]);
for(i = 1; i <= V; i++)
f[i] = inf;
f[0] = 0;
for(j = 0; j < N; j++)
CompletePack(f, C[j], W[j], V);
if(f[V] >= inf)
printf ("This is impossible.\n");
else
printf ("The minimum amount of money in the piggy-bank is %d.\n", f[V]);
}
return 0;
}