月饼_GPLT

#include <stdio.h>#include <algorithm>using namespace std;struct MJ{    double Cu;    double Ji;    double Li;}Mj[1100];bool cmp(MJ x,MJ y){    if(x.Li<y.Li)        return false;    else         return true;}int main(){    int n,X;    scanf("%d %d",&n,&X);    for(int i=0;i<n;++i)        scanf("%lf",&Mj[i].Cu);    for(int i=0;i<n;++i){        scanf("%lf",&Mj[i].Ji);        Mj[i].Li=Mj[i].Ji/Mj[i].Cu;    }    sort(Mj,Mj+n,cmp);    int i=0;    double sum=0;    while(X&&i!=n){        if(X>=Mj[i].Cu){            sum+=Mj[i].Ji;            X-=Mj[i].Cu;        }        else{            sum+=Mj[i].Li*X;            X=0;        }        i++;    }    printf("%.2lf\n",sum);          return 0;}