1020. 月饼 (25):结构体排序

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

#define Max 1000

struct Node{
       double Stock;
       double Price;
       double Rate;
};

bool Comp( Node a, Node b )
{
    return a.Rate>b.Rate;
}

int main()
{
     int N, M;
     Node MoonCake[Max+1];
     while( cin>>N>>M )
     {
         for( int i=0; i<N; i++ )
                cin>>MoonCake[i].Stock;
         for( int i=0; i<N; i++ ){
                cin>>MoonCake[i].Price;
                MoonCake[i].Rate = MoonCake[i].Price/MoonCake[i].Stock;
         }
         sort(MoonCake, MoonCake+N, Comp);
        double Ans=0;
         for( int i=0; i<N; i++ )
         {
             if( MoonCake[i].Stock<M )
             {
                                 Ans+=MoonCake[i].Price;
                M-=MoonCake[i].Stock;
             }
             else{
                                 Ans+=MoonCake[i].Rate*M;
                 break;
             }
         }
         cout<<fixed<<setprecision(2)<<Ans<<endl;
     }
     return 0;
}