天梯赛 - L2-003 月饼

题目链接：https://www.patest.cn/contests/gplt/L2-003

现在只能做水题~

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 const int maxn = 1e3+;
 struct _node_
 {
     double save;
     double saleprice;
     double costperformance;
 };
 _node_ node[maxn];
 bool cmp(_node_ A,_node_ B)
 {
     return A.costperformance>B.costperformance;
 }
 int main()
 {
     int n;
     double maxneed;
     cin>>n>>maxneed;
     for(int i=;i<n;i++)
     {
         cin>>node[i].save;
     }
     for(int i=;i<n;i++)
     {
         cin>>node[i].saleprice;
     }
     for(int i=;i<n;i++)
     {
         node[i].costperformance = node[i].saleprice/node[i].save;
     }
     sort(node,node+n,cmp);
     double sum = ;
     for(int i=;i<n;i++)
     {
         if(node[i].save<maxneed)
         {
             sum += node[i].saleprice;
             maxneed -= node[i].save;
         }
         else if(node[i].save>=maxneed)
         {
             sum += node[i].costperformance*maxneed;
             break;
         }
     }
     printf("%.2f\n",sum);
     return ;
 }