编辑代码

#include <stdio.h>


typedef struct {
    char *name; 
    double weight; 
    double value; 
    double ratio; 
} Fruit;


int compare(const void *a, const void *b) {
    Fruit *fruit1 = (Fruit *)a;
    Fruit *fruit2 = (Fruit *)b;
    if (fruit1->ratio < fruit2->ratio) return 1;
    if (fruit1->ratio > fruit2->ratio) return -1;
    return 0;
}


void fractionalKnapsack(Fruit fruits[], int n, double capacity) {
    qsort(fruits, n, sizeof(Fruit), compare);
    double totalValue = 0; // 背包中水果的总价值
    for (int i = 0; i < n; i++) {
        if (fruits[i].weight <= capacity) {
            // 当前水果可以完全装入背包
            capacity -= fruits[i].weight;
            totalValue += fruits[i].value;
            printf("装入全部%s: %.0fkg, 价值: %.0f元\n", fruits[i].name, fruits[i].weight, fruits[i].value);
        } else {
            // 当前水果只能装入部分
            totalValue += fruits[i].ratio * capacity;
            printf("装入部分%s: %.0fkg, 价值: %.0f元\n", fruits[i].name, capacity, fruits[i].ratio * capacity);
            break; 
        }
    }
    printf("总价值: %.0f元\n", totalValue);
}

int main() {
    Fruit fruits[] = {
        {"苹果", 15, 300, 20},
        {"香蕉", 18, 180, 10},
        {"橘子", 10, 150, 15},
        {"猕猴桃", 9, 270, 30}
    };
    int n = 4;
    double capacity = 20;

    for (int i = 0; i < n; i++) {
        fruits[i].ratio = fruits[i].value / fruits[i].weight;
    }

    fractionalKnapsack(fruits, n, capacity);

    return 0;
}