piggy bank（背包算法）

最新推荐文章于 2023-07-13 20:23:20 发布

原创最新推荐文章于 2023-07-13 20:23:20 发布 · 433 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

本文介绍了一种解决存款问题的算法，通过动态规划求解从一组银行存款中找到最接近给定重量的组合，以最小化所需金额。代码实现涉及结构体、数组和两个嵌套循环。

#include<iostream>
#include<algorithm>
using namespace std;
const long long int maxi = 9999999999999;
struct bank {
   int value, wei;
};
long long f[10006];
bank b[505];
int main() {
   int T;
   cin >> T;
   while(T--) {
       int E,F,N,weight;
       cin >> E >> F;
       weight = F - E;
       cin >> N;
       for (int i = 1; i <= weight; i++) f[i] = maxi;
       f[0] = 0;
       for (int i = 1; i <= N; i++) {
           cin >> b[i].value >> b[i].wei;
       }
       for (int i = 1; i <= N; i++) {
           for (int j = b[i].wei; j <= weight; j++) {
               f[j] = min(f[j], f[j - b[i].wei] + b[i].value);
           }
       }
       if (f[weight] != maxi) cout << "The minimum amount of money in the piggy-bank is " << f[weight] <<"." << endl;
       else cout << "This is impossible." << endl;
   }

}