Submission #52664

#TimeUsernameProblemLanguageResultExecution timeMemory
52664snat123Sure Bet (CEOI17_sure)C++14
0 / 100
2 ms452 KiB
#include <bits/stdc++.h> using namespace std; const int mxN=1e5; int n; double a[mxN+1], b[mxN+1], ans, sa, sb; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i=0; i<n; ++i) cin >> a[i] >> b[i]; sort(a, a+n+1); sort(b, b+n+1); for(int i1=n-1, i2=n-1; i1>=0&&i2>=0; ) { if(sa<sb) sa+=a[i1--]; else sb+=b[i2--]; ans=max(min(sa, sb)-(n-i1)-(n-i2), ans); } cout << fixed << setprecision(4) << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...