# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
447455 | fuad27 | Sure Bet (CEOI17_sure) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define double long double
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,Ai=0,Bi=0;cin>>n;
long double ans=0.0,sA=0.0,sB=0.0,a[n+1],b[n+1];
for(int i=0;i<n;i++)cin>>a[i]>>b[i];
sort(a,a+n);sort(b,b+n);
reverse(a,a+n);reverse(b,b+n);
while(Ai<=n && Bi<=n) {
if(sB<sA)sB+=b[Bi],Bi++;
else sA+=a[Ai],Ai++;
ans = max(ans,min(sA-Ai-Bi,sB-Ai-Bi));
}
cout.precision(4);
cout<<fixed<<ans;
}