宇宙最牛逼的题解

#include<bits/stdc++.h>
using namespace std;
struct coin
{
int m;
int v;
double avg;
}c[1050];
bool cmp(coin c1,coin c2)
{
return c1.avg>c2.avg;

}
int main()
{
int n,t;cin>>n>>t;
for(int i = 1;i<=n;i++)
{
cin>>c[i].m>>c[i].v;
c[i].avg = c[i].v1.0/c[i].m;
}
sort(c+1,c+1+n,cmp);
double sum=0;
for(int i=1;i<=n;i++)
{
if(c[i].m<=t)
{
sum+=c[i].v;
t -= c[i].m;
}
else
{
sum+=tc[i].avg;
t=0;
break;
}
}
printf("%.2f",sum);
return 0;
}