# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126993 | 2019-07-08T18:25:38 Z | Lawliet | Sure Bet (CEOI17_sure) | C++14 | 2 ms | 380 KB |
#include <bits/stdc++.h> #define MAX 1010 using namespace std; int n; float ans = -1.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); for(int k = 1 ; k <= n ; k++) { for(int g = 1 ; g < n ; g++) { if(a[g] > a[g + 1]) swap(a[g] , a[g + 1]); if(b[g] > b[g + 1]) swap(b[g] , b[g + 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++) { 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 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 128 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 128 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 256 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Incorrect | 2 ms | 256 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 128 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 380 KB | Output is correct |
7 | Correct | 2 ms | 256 KB | Output is correct |
8 | Correct | 2 ms | 256 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 376 KB | Output is correct |
11 | Incorrect | 2 ms | 256 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |