/*HDU1114 &&POJ1384：Piggy-Bank(完全背包)Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from

简单dp #include <iostream>using namespace std;int dp[10005];int main(){int v[505];int w[505];int e,f;int T;cin>>T;while (T--){cin>>e>>f;memset(v,0,sizeof(v));memset(w,0,sizeof(w));memset(dp,0,sizeof

给定存钱罐重量f - e，n种硬币的价值p，重量w。求里面最少有多少钱。 1.最少价值，全部初始化为inf，dp[0] = 0，转移的时候求min 2.装满背包，看dp[f - e] 是否仍为inf，是的话，说明背包不满。 #include <iostream> #include <algorithm> #include <cstdio> using namespa