# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
962258 | LucaIlie | Sure Bet (CEOI17_sure) | C++17 | 1 ms | 2392 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>
using namespace std;
const int MAX_N = 1e5;
const long long MAX_P = 1e15;
const int DEC = 1e4;
int a[MAX_N + 1], b[MAX_N + 1];
long long sa[MAX_N + 1], sb[MAX_N + 1];
int main() {
int n;
cin >> n;
for ( int i = 1; i <= n; i++ ) {
double x, y;
cin >> x >> y;
a[i] = x * DEC;
b[i] = y * DEC;
}
sort( a + 1, a + 1 + n );
reverse( a + 1, a + 1 + n );
sort( b + 1, b + 1 + n );
reverse( b + 1, b + 1 + n );
for ( int i = 1; i <= n; i++ ) {
sa[i] = sa[i - 1] + a[i];
sb[i] = sb[i - 1] + b[i];
printf( "%d %d\n", sa[i], sb[i] );
}
long long l = 0, r = MAX_P;
while ( r - l > 1 ) {
long long p = (l + r) / 2;
bool isPos = false;
for ( int i = 0; i <= n; i++ ) {
int j = min( (long long)n, max( 0LL, (sa[i] - i * DEC - p) / DEC ) );
if ( min( sa[i], sb[j] ) - (i + j) * DEC >= p )
isPos = true;
}
if ( isPos )
l = p;
else
r = p;
}
cout << fixed << setprecision( 4 ) << (double)l / DEC;
return 0;
}
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... |