POJ 1384 【完全背包】

这道题花了我好长时间，因为莫名其妙的问题WA，一直到最后AC都没有懂我当初除了初始化太小以外还出了什么问题

AC代码

#include<stdio.h>
#include<string.h>
int min( int a, int b){return a < b ? a : b;}
int dp[200005], weight, value;
int main(void){
	int t, j, i, empty, full, diff, num;
	scanf("%d", &t);
	while(t--){
		scanf("%d%d", &empty, &full);
		diff = full - empty;
		scanf("%d", &num);
		for( i = 1; i <= diff; i++) dp[i] = 10000000;
		dp[0] = 0;
		for( i = 1; i <= num; i++){
			scanf("%d%d", &value, &weight);
			for( j = weight; j <= diff; j++)
				dp[j] = min( dp[j], dp[j-weight]+value);
		}
		if(dp[diff]!=10000000)
            printf("The minimum amount of money in the piggy-bank is %d.\n",dp[diff]);
        else printf("This is impossible.\n");
	}
	return 0;
}