编辑代码

#include <stdio.h>

int max(int a, int b) {
    return (a > b) ? a : b;
}

void pack(int W, int wt[], int val[], int n) {
    int i, w;
    int K[2][W + 1];
    for (i = 0; i <= n; i++) {
        for (w = 0; w <= W; w++) {
            if (i % 2 == 0) {
                if (i == 0 || w == 0)
                    K[0][w] = 0;
                else if (wt[i - 1] <= w)
                    K[0][w] = max(val[i - 1] + K[1][w - wt[i - 1]], K[1][w]);
                else
                    K[0][w] = K[1][w];
            } else {
                if (i == 0 || w == 0)
                    K[1][w] = 0;
                else if (wt[i - 1] <= w)
                    K[1][w] = max(val[i - 1] + K[0][w - wt[i - 1]], K[0][w]);
                else
                    K[1][w] = K[0][w];
            }
        }
    }
    int totalValue = (n % 2 == 0) ? K[0][W] : K[1][W];
    int remainingWeight = W;
    printf("装水果：\n");
    for (i = n; i > 0 && totalValue > 0; i--) {
        if (i % 2 == 0) {
            if (totalValue != K[1][remainingWeight]) {
                if (i == 2) {
                    printf("苹果 15kg 300元\n");
                } else if (i == 3) {
                    printf("香蕉 18kg 180元\n");
                } else if (i == 4) {
                    printf("橘子 10kg 150元\n");
                } else if (i == 5) {
                    printf("猕猴桃 9kg 270元\n");
                }
                totalValue -= val[i - 1];
                remainingWeight -= wt[i - 1];
            }
        } else {
            if (totalValue != K[0][remainingWeight]) {
                if (i == 1) {
                    printf("苹果 15kg 300元\n");
                } else if (i == 3) {
                    printf("香蕉 18kg 180元\n");
                } else if (i == 4) {
                    printf("橘子 10kg 150元\n");
                } else if (i == 5) {
                    printf("猕猴桃 9kg 270元\n");
                }
                totalValue -= val[i - 1];
                remainingWeight -= wt[i - 1];
            }
        }
    }
}

int main() {
    int val[] = {300, 180, 150, 270};
    int wt[] = {15, 18, 10, 9};
    int W = 20;
    int n = sizeof(val) / sizeof(val[0]);
    printf("最大总价值: %d\n", max( pack(W, wt, val, n), pack(W, wt, val, n-1) ) );
    return 0;
}