Submission #447456

#TimeUsernameProblemLanguageResultExecution timeMemory
447456fuad27Sure Bet (CEOI17_sure)C++14
0 / 100
0 ms204 KiB
#include<bits/stdc++.h> using namespace std; int main () { 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...