Submission #155583

#TimeUsernameProblemLanguageResultExecution timeMemory
155583lukameladzeSure Bet (CEOI17_sure)C++14
100 / 100
224 ms2044 KiB
#include <bits/stdc++.h> using namespace std; double a[100005],b[100005],k,l,r,k1,ans,sum1,sum2; int n,fs,j; 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; for (int i=n; i>=1; i--) { sum1+=a[i]-1; sum2--; while (sum2<sum1) { if (j<1) break; sum1--; sum2+=b[j]-1; ans=max(ans,min(sum1,sum2)); j--; } } sum1=0; sum2=0; j=n; for (int i=n; i>=1; i--) { sum2+=b[i]-1; sum1--; while (sum1<sum2) { if (j<1) break; sum2--; sum1+=a[j]-1; ans=max(ans,min(sum1,sum2)); j--; } } printf("%.4lf",(double)ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...