【贪心算法】计算出售月饼可获得的最大收益

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

struct mooncake{
    double store;
    double sell;
    double price;
}cake[1000];

bool cmp(mooncake a, mooncake b){
    return a.price>b.price;
}

int main(){
    int n;
    double D;
    scanf("%d%lf", &n, &D);
    for(int i=0; i<n; i++){
        scanf("%lf", cake[i].store);
    }
    for(int i=0; i<n; i++){
        scanf("%lf", cake[i].sell);
        cake[i].price=cake.sell/cake[i].store;
    }
    sort(cake, cake+n, cmp);
    double ans=0;
    for(int i=0; i<n; i++){
        if(cake[i].store<=D){
            D-=cake[i].store;
            ans+=cake[i].sell;
        }
        else
            ans+=D*cake[i].price;
            break;
    }
    printf("%.2f\n", ans);
    return 0;
}