Submission #841508

#TimeUsernameProblemLanguageResultExecution timeMemory
841508treewaveSure Bet (CEOI17_sure)C++17
60 / 100
62 ms3632 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; vector<double> a(n), b(n); for (int i = 0; i < n; i++){ cin >> a[i] >> b[i]; } sort(a.rbegin(), a.rend()); sort(b.rbegin(), b.rend()); double ans = 0, sa = 0, sb = 0, ptr_a = 0, ptr_b = 0; for (int i = 1; i <= 2 * n; i++){ if (sa < sb && ptr_a != n){ sa += a[ptr_a]; ptr_a++; } else{ sb += b[ptr_b]; ptr_b++; } ans = max(ans, min(sa, sb) - i); } printf("%.4lf\n", ans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...