80分求调

#include<bits/stdc++.h>
using namespace std;
int n,t;
struct jb{
	double zl,jz;
	double b;
}a[110];
double sum,cnt;
bool cmp(jb a,jb b){
	return a.b>b.b;
} 
int main(){
	cin>>n>>t;
	for(int i=1;i<=n;i++){
		cin>>a[i].zl>>a[i].jz;
		a[i].b=a[i].jz/a[i].zl;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		if(sum>=t){
			cout<<fixed<<setprecision(2)<<cnt-((sum-t)*a[i-1].b*1.00);
			break;
		}else{
			sum+=a[i].zl;
			cnt+=a[i].jz;
		}
	}
	return 0;
}