# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126985 | Lawliet | Sure Bet (CEOI17_sure) | C++14 | 2 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define MAX 1010
using namespace std;
int n;
float ans;
float sumA, sumB;
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 qtdA = 0 ; qtdA <= n ; qtdA++)
{
if(qtdA != 0) sumA += a[ n - qtdA + 1 ];
sumB = 0.0;
for(int qtdB = 0 ; qtdB <= n ; qtdB++)
{
if(qtdB != 0) sumB += b[ n - qtdB + 1 ];
float fA = (float) qtdA;
float fB = (float) qtdB;
float aux;
if(sumA > sumB) aux = sumB - fA - fB;
else aux = sumA - fA - fB;
ans = max(ans , aux);
}
}
printf("%.4lf\n",(double) ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |