Submission #1261946

#TimeUsernameProblemLanguageResultExecution timeMemory
1261946new_accSure Bet (CEOI17_sure)C++20
60 / 100
42 ms1864 KiB
#include<iostream> #include<iomanip> #include<algorithm> using namespace std; double A[100002]; double B[100002]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; for(int i=1; i<=n; i++) cin>>A[i]>>B[i]; sort(A+1, A+n+1, greater()); sort(B+1, B+n+1, greater()); double wynA = A[1], wynB = B[1], teraz = min(wynA, wynB)-2, wyn = 0; wyn = max(wyn, teraz); int wskA = 1, wskB = 1; for(int i=3; i<=n*2; i++){ if(wynA < wynB){ wynA += A[++wskA]; }else{ wynB += B[++wskB]; } //cout<<teraz<<'\n'; teraz = min(wynA, wynB)-i; wyn = max(wyn, teraz); } cout<<fixed<<setprecision(4)<<wyn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...