WA了#1

代码如下

蒟蒻的呼唤

#include<bits/stdc++.h>
using namespace std;
struct node{
    double zl,jz;
}a[105];
bool cmp(node xx,node yy){
	return xx.jz/xx.zl>yy.jz/yy.zl;
}
double ans;int t,i,n;
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n>>t;
	for(i=0;i<n;i++)
	    cin>>a[i].zl>>a[i].jz;
	sort(a,a+n,cmp);
	for(i=0;i<n;i++){
		if(t-a[i].zl<0)break;
		ans+=a[i].jz;
		t-=a[i].zl;
	}
	if(t>0)ans+=a[i].jz*(t/a[i].zl);
	cout<<fixed<<setprecision(2)<<ans<<endl;
	return 0;
}