PAT (Basic Level) Practice （中文）-1020 月饼 (25 分)

#include<bits/stdc++.h>

using namespace std;
double maxn;
int n;
struct node{
	double sum;
	double money;
	double prise;
}a[1010];

bool cmpp(node x,node y){
	  return x.prise > y.prise;
}

int main(){
	cin>>n>>maxn;
	for(int i=0;i<n;i++){
		cin>>a[i].sum;
	}
	for(int i=0;i<n;i++){
		cin>>a[i].money;
	}
	for(int i=0;i<n;i++){
		a[i].prise = (a[i].money/a[i].sum);
	}
	sort(a,a+n,cmpp);
	double ans=0.0;
	//double res;
	for(int i=0;i<n;i++){
		if(maxn >= a[i].sum){
			maxn -= a[i].sum;
			ans += a[i].money;
			//printf("%.2lf\n",ans);
		}
		else{
			ans += (a[i].prise * maxn);
			break;
		} 
	}
	printf("%.2lf\n",ans);
}