# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
841510 | 2023-09-01T16:02:24 Z | treewave | Sure Bet (CEOI17_sure) | C++17 | 1 ms | 212 KB |
#include <bits/stdc++.h> using namespace std; #define double long double 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); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |