1052. 0-1背包问题

#include <iostream>
#include <algorithm>
using namespace std;

int bag[21][100001];

int w[21];
int p[21];

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        int n, M;
        cin >> n >> M;
        for (int i = 1; i <= n; ++i)
            cin >> w[i] >> p[i];
        for (int k = 1; k <= n; ++k)
        {
            for (int cap = 1; cap <= M; ++cap)
            {
                if (w[k] > cap)
                {
                    //第k件太重
                    bag[k][cap] = bag[k - 1][cap];
                }
                else
                {
                    //装或不装
                    bag[k][cap] = max(bag[k - 1][cap - w[k]] + p[k], bag[k - 1][cap]);
                }
            }
        }
        cout << bag[n][M] << endl;
    }
    return 0;
}

T = int(input())
for _ in range(T):
    n, m = map(int, input().split())
    items = []
    for i in range(n):
        items.append([int(i) for i in input().split()])
    res = [0]*(m+1)
    for i in range(n):
        for j in range(m, -1, -1):
            if j-items[i][0] >= 1:
                res[j] = max(res[j], res[j-items[i][0]]+items[i][1])
    print(res[m])

//dp[i][v]代表将前i个物品放入背包为v大小的最大值
//dp[i][v]=max{dp[i-1][v],dp[i-1][v-weight[i]]+value[i]};
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
struct Node {
    int weight;
    int value;
};
Node a[21];
int dp[21][100010];
int main() {
    int num;
    cin >> num;
    while (num--) {
        memset(dp, 0, sizeof(dp));
        memset(a, 0, sizeof(a));
        int n, m;
        cin >> n >> m;
        for (int i = 1; i <= n; ++i) {
            cin >> a[i].weight >> a[i].value;
        }
        for (int i = 1; i <= n; ++i) {
            for (int v = 1; v <= m; ++v) {
                if (v >= a[i].weight) {
                    dp[i][v] = max(dp[i - 1][v], dp[i - 1][v - a[i].weight] + a[i].value);
                }
                else {
                    dp[i][v] = dp[i - 1][v];
                }
            }
        }
        cout << dp[n][m] << endl;
    }
    return 0;
}

int main() {
    uint32_t t; std::cin >> t;
    for (uint32_t query = 0; query < t; ++query) {
        uint32_t n, m; std::cin >> n >> m;
        vector<uint32_t> w(n), v(n), dp(m + 1, 0);
        for (uint32_t i = 0; i < n; ++i)
            std::cin >> w[i] >> v[i];
        for (uint32_t i = 0; i < n; ++i)
            for (uint32_t j = m; j >= w[i]; --j)
                if (dp[j] < dp[j - w[i]] + v[i])
                    dp[j] = dp[j - w[i]] + v[i];
        printf("%u\n", dp[m]);
    }
}