编辑代码

#include <stdio.h>
int max(int a, int b) {
    return (a > b) ? a : b;
}
int bag(int items, int capacity, int weights[], int values[]) {
    int dt[items + 1][capacity + 1];

    for (int i = 0; i <= items; i++) {
        for (int j = 0; j <= capacity; j++) {
            if (i == 0 || j == 0) {
                dt[i][j] = 0;
            } else if (weights[i - 1] <= j) {
                dt[i][j] = max(dt[i - 1][j], dt[i - 1][j - weights[i - 1]] + values[i - 1]);
            } else {
                dt[i][j] = dt[i - 1][j];
            }
        }
    }

    return dt[items][ capacity];
}

int main() {
    int items = 3;
    int capacity = 50;
    int weights[] = {10, 20, 30};
    int values[] = {40, 20, 50};
    int result = bag(items, capacity, weights, values);
    printf("最大价值: %d\n", result);
    return 0;
}