编辑代码

#include <stdio.h>

int knapsack(int weight[], int value[], int n, int m);

int main() {
    int weight[] = {1, 1, 2, 4};
    int value[] = {1000, 3000, 3000, 4000};
    int m = 2;
    int c = knapsack(weight, value, sizeof(weight)/sizeof(weight[0]), m);
    printf("%d\n", c);
    return 0;
}

int knapsack(int weight[], int value[], int n, int m) {
    int dp[n + 1][m + 1];
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= m; j++) {
            if (i == 0 || j == 0) {
                dp[i][j] = 0;
            } else if (weight[i - 1] <= j) {
                dp[i][j] = (value[i - 1] + dp[i - 1][j - weight[i - 1]]) > dp[i - 1][j] ? (value[i - 1] + dp[i - 1][j - weight[i - 1]]) : dp[i - 1][j];
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    return dp[n][m];
}