hdu1114PiggyBank(完全背包）

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

初始化为无穷大

#include <iostream>
#include<cstdio>
#include<string.h>
#define INF 0xfffffff
using namespace std;
int main()
{
    int i,j,k,n,t,f[10001],v,p[501],w[501];
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d",&n,&v);
        v = v-n;
        scanf("%d",&n);
        for(i = 1; i <= n; i++)
        scanf("%d%d",&p[i],&w[i]);
        for(i = 1 ; i <= v; i++)
        f[i] = INF;
        f[0] = 0;
        for(i =1; i <= n; i++)
        {
            for(j = w[i] ; j <= v; j++)//shu xu 
            if(f[j]>f[j-w[i]]+p[i])
            f[j] = f[j-w[i]]+p[i];
        }
        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;
}