Submission #155620

#TimeUsernameProblemLanguageResultExecution timeMemory
155620lukameladzeSure Bet (CEOI17_sure)C++14
100 / 100
254 ms2516 KiB
#include<bits/stdc++.h> using namespace std; int n,j,j11; double a[100005],b[100005],l,r,ans,w; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]>>b[i]; sort(a+1,a+n+1); sort(b+1,b+n+1); j=n; j11=n; while(true) { w=min(l,r); ans=max(w,ans); if(l>=r) { if(j11<1) break; r+=b[j11]-1; j11--; l--; } else { if(j<1) break; l+=a[j]-1; j--; r--; } } printf("%.4lf",(double)ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...