L2-003. 月饼（贪心）

 L2-003. 月饼

简单的结构体和排序应用题

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
struct node
{
    double sum,zongjia,danjia;
}yuebing[1005];
bool cmp(node a,node b)
{
    return a.danjia>b.danjia;
};
int main()
{
    int n,maxn;
    cin>>n>>maxn;
    int i;
    for(i=0;i<n;i++)
    {
        cin>>yuebing[i].sum;
    }
    for(i=0;i<n;i++)
    {
        cin>>yuebing[i].zongjia;
    }
    for(i=0;i<n;i++)
    {
        yuebing[i].danjia=yuebing[i].zongjia/yuebing[i].sum;
    }
    sort(yuebing,yuebing+n,cmp);
    double res=0.0;
    for(i=0;i<n;i++)
    {
        if(maxn<=0)break;
        if(maxn>=yuebing[i].sum)
        {
            maxn-=yuebing[i].sum;
            res+=yuebing[i].zongjia;
        }
        else if(maxn<yuebing[i].sum)
        {
            res+=maxn*yuebing[i].danjia;
            maxn=0;
        }
    }
    printf("%.2lf
",res);
    return 0;
}