编辑代码

#include <stdio.h>

// 定义最大物品数量和背包容量
#define MAX_ITEMS 100
#define MAX_CAPACITY 100

// 辅助函数：返回两个数中的较大值
int max(int a, int b) {
    return (a > b) ? a : b;
}

// 0/1背包函数
int knapsack(int weights[], int values[], int N, int capacity) {
    int dp[MAX_ITEMS + 1][MAX_CAPACITY + 1];

    // 初始化
    for (int i = 0; i <= N; i++) {
        for (int j = 0; j <= capacity; j++) {
            if (i == 0 || j == 0) {
                dp[i][j] = 0;
            } else if (weights[i - 1] <= j) {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weights[i - 1]] + values[i - 1]);
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }

    // 返回最终最优解
    return dp[N][capacity];
}

int main() {
    // 示例数据
    int weights[] = {2, 1, 3};
    int values[] = {4, 2, 3};
    int N = 3;  // 物品数量
    int capacity = 4;

    // 调用背包函数并输出结果
    int result = knapsack(weights, values, N, capacity);
    printf("最大总价值：%d\n", result);

    return 0;
}