编辑代码

#include <iostream>
#include <algorithm>
using namespace std;

// 定义每种豆子的名称，重量，价值和单价
struct Bean {
    string name;
    double weight;
    double value;
    double price;
};

// 按照单价从高到低排序
bool compare(Bean a, Bean b) {
    return a.price > b.price;
}

// 贪心函数，返回背包中的最大价值
double greedyKnapsack(double capacity, Bean beans[], int n) {
    // 对豆子按照单价从高到低排序
    sort(beans, beans + n, compare);
    // 初始化当前重量和当前价值为0
    double currentWeight = 0;
    double currentValue = 0;
    // 遍历每种豆子
    for (int i = 0; i < n; i++) {
        // 如果当前豆子可以全部放入
        if (currentWeight + beans[i].weight <= capacity) {
            // 更新当前重量和当前价值
            currentWeight += beans[i].weight;
            currentValue += beans[i].value;
            // 输出放入的豆子的信息
            cout << "放入全部 " << beans[i].name << " 到背包里, 重量是: " << beans[i].weight << ", 价值是: " << beans[i].value << endl;
        }
        // 如果当前豆子只能放入部分
        else {
            // 计算剩余的空间
            double remain = capacity - currentWeight;
            // 更新当前重量和当前价值
            currentWeight += remain;
            currentValue += remain * beans[i].price;
            // 输出放入的豆子的信息
            cout << "放入部分 " << beans[i].name << " 到背包里, 重量是: " << remain << ", 价值是: " << remain * beans[i].price << endl;
            break;
        }
    }
    return currentValue;
}

int main() {
    // 背包容量
    double capacity = 100;
    // 豆子数量
    int n = 5;
    Bean beans[] = {
        {"黄豆", 50, 60, 1.2},
        {"绿豆", 40, 40, 1},
        {"红豆", 30, 30, 1},
        {"黑豆", 20, 80, 4},
        {"青豆", 10, 100, 10}
    };

    double maxValue = greedyKnapsack(capacity, beans, n);
    cout << "最大价值是: " << maxValue << endl;
    return 0;
}