# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303032 | 2020-09-19T19:00:03 Z | Kenzo_1114 | Sure Bet (CEOI17_sure) | C++17 | 1 ms | 384 KB |
#include<bits/stdc++.h> using namespace std; const int MAXN = 100010; int n; double a[MAXN], b[MAXN], ans = 0.0000, sa = 0.0000, sb = 0.0000; int main () { scanf("%d", &n); for(int i = 0; i < n; i++) scanf("%lf %lf", &a[i], &b[i]); sort(a, a + n); reverse(a, a + n); sort(b, b + n); reverse(b, b + n); // for(int i = 0; i < n; i++) printf("a[%d] = %.4lf\n", i, a[i]); // for(int i = 0; i < n; i++) printf("b[%d] = %.4lf\n", i, b[i]); int ida = 0, idb = 0; for(int i = 0; i < n; i++) { if(sa >= sb && idb < n) sb += b[idb++]; else if(sa < sb && ida < n) sa += a[ida++]; else break; ans = max(ans, min(sa, sb) - i - 1); } printf("%.4lf\n", (double) ans); } /* 4 1.4 3.7 1.2 2 1.6 1.4 1.9 1.5 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 1 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |