结构体数组排序了解一下
/*
qq:1239198605
ctgu_yyf
*/
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#define ll long long
using namespace std;
struct sale{
int v;
int cc;
double s;
}yb[1005];
bool cmp(const sale &a,const sale &b)
{
return a.s>b.s;
}
int main()
{
ios::sync_with_stdio(false);
int n,c;
cin>>n>>c;
for(int i=0;i<n;i++)
cin>>yb[i].cc;
for(int i=0;i<n;i++)
cin>>yb[i].v;
for(int i=0;i<n;i++)
yb[i].s=(double)yb[i].v/yb[i].cc;
sort(yb,yb+n,cmp);
double sum=0.0;
/*
cout<<"**"<<endl;
for(int i=0;i<n;i++)
cout<<yb[i].cc<<" ";
cout<<endl;
for(int i=0;i<n;i++)
cout<<yb[i].v<<" ";
cout<<endl;
for(int i=0;i<n;i++)
cout<<yb[i].s<<" ";
cout<<endl;
*/
for(int i=0;i<n;i++)
{
if(c<yb[i].cc)
{
sum=sum+yb[i].s*c;
break;
}
else
{
sum=sum+yb[i].s*yb[i].cc;
c=c-yb[i].cc;
}
}
printf("%.2lf\n",sum);
return 0;
}