# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126994 | 2019-07-08T18:33:05 Z | Lawliet | Sure Bet (CEOI17_sure) | C++14 | 2 ms | 256 KB |
#include <bits/stdc++.h> #define MAX 1010 using namespace std; int n; float ans = -1000000000.0; float a[MAX]; float b[MAX]; int main() { scanf("%d",&n); for(int g = 1 ; g <= n ; g++) scanf("%f %f",&a[g],&b[g]); sort(a + 1 , a + n + 1); sort(b + 1 , b + n + 1); float sumA, sumB; sumA = 0; for(int qtdA = 0 ; qtdA <= n ; qtdA++) { sumA += a[ n - qtdA + 1 ]; sumB = 0; for(int qtdB = 0 ; qtdB <= n ; qtdB++) { if(qtdA == 0 && qtdB == 0) continue; sumB += b[ n - qtdB + 1 ]; ans = max(ans , min(sumA , sumB) - qtdA - qtdB); } } printf("%.4f\n",ans); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |