# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126998 | Lawliet | Sure Bet (CEOI17_sure) | C++14 | 5 ms | 380 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;
double ans = -4000000.0;
double a[MAX];
double b[MAX];
int main()
{
scanf("%d",&n);
for(int g = 1 ; g <= n ; g++)
scanf("%lf %lf",&a[g],&b[g]);
sort(a + 1 , a + n + 1);
sort(b + 1 , b + n + 1);
double sumA, sumB;
sumA = 0;
//printf("-> %lf\n",b[1] + b[2] + b[3] + b[4]);
for(int qtdA = 0 ; qtdA <= n ; qtdA++)
{
sumA += a[ n - qtdA + 1 ];
sumB = 0;
for(int qtdB = 0 ; qtdB <= n ; qtdB++)
{
//printf("ooooooooo %lf + %lf = %lf\n",sumB,b[n - qtdB + 1],sumB + b[n - qtdB + 1]);
sumB = sumB + b[ n - qtdB + 1 ];
//printf("A %d %lf B %d %lf %lf %lf\n",qtdA,sumA,qtdB,sumB,b[n - qtdB + 1],min(sumA , sumB) - qtdA - qtdB);
ans = max(ans , min(sumA , sumB) - qtdA - qtdB);
}
}
printf("%.4lf\n",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... |