L2-003 月饼

L2-003 月饼

#include<bits/stdc++.h>
//#define int long long
#define PII pair<int,int>
using namespace std;
const int N=1010;

struct Node{
	double num,w;
	double dj;
}node[N];

int n;
double m;

bool cmp(struct Node &a,struct Node &b){
	return a.dj>b.dj;
}

signed main(){
	cin>>n>>m;
	for(int i=0;i<n;i++)
		cin>>node[i].num;
	for(int i=0;i<n;i++)
		cin>>node[i].w;
	for(int i=0;i<n;i++)
		node[i].dj=(double)node[i].w/node[i].num;
	sort(node,node+n,cmp);
	double sum=0;
	for(int i=0;i<n;i++){
		if(m>=node[i].num){
			sum+=node[i].w;
		}else{
			sum+=m*node[i].dj;
            break;
		}
        m-=node[i].num;
	}
	printf("%.2lf",sum);
	return 0; 
}