| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 79333 |
2018-10-12T09:26:45 Z |
aminra |
Sure Bet (CEOI17_sure) |
C++14 |
|
236 ms |
18456 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)3e5 + 7;
const int infint = (int)1e9;
int n;
ld a[MAXN], b[MAXN];
ld g(int mid, int ted)
{
ld c1 = 0;
if(mid)
c1 = a[mid - 1];
mid = ted - mid;
ld c2 = 0;
if(mid)
c2 = b[mid - 1];
return min(c1, c2);
}
ld f(int ted)
{
//jelo tarin i ro mikhaim ke g(i) > g(i - 1)
int L = max(0, ted - n), R = ted + 1;
while(R - L > 1)
{
int mid = (R + L) >> 1;
if(g(mid, ted) > g(mid - 1, ted))
L = mid;
else
R = mid;
}
return g(L, ted);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i] >> b[i];
sort(a, a + n, greater<double> ());
sort(b, b + n, greater<double> ());
for (int i = 1; i < n; i++)
a[i] += a[i - 1], b[i] += b[i - 1];
ld ans = 0;
for (int i = 1; i <= 2 * n; i++)
ans = max(ans, f(i) - i);
cout << fixed << setprecision(4) << ans;
}
| # |
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 |
576 KB |
Output is correct |
| 4 |
Correct |
2 ms |
624 KB |
Output is correct |
| 5 |
Correct |
2 ms |
624 KB |
Output is correct |
| 6 |
Correct |
2 ms |
624 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 |
576 KB |
Output is correct |
| 4 |
Correct |
2 ms |
624 KB |
Output is correct |
| 5 |
Correct |
2 ms |
624 KB |
Output is correct |
| 6 |
Correct |
2 ms |
624 KB |
Output is correct |
| 7 |
Correct |
2 ms |
624 KB |
Output is correct |
| 8 |
Correct |
2 ms |
624 KB |
Output is correct |
| 9 |
Correct |
2 ms |
624 KB |
Output is correct |
| 10 |
Correct |
2 ms |
624 KB |
Output is correct |
| 11 |
Correct |
2 ms |
624 KB |
Output is correct |
| 12 |
Correct |
3 ms |
660 KB |
Output is correct |
| 13 |
Correct |
4 ms |
856 KB |
Output is correct |
| 14 |
Correct |
3 ms |
856 KB |
Output is correct |
| 15 |
Correct |
4 ms |
856 KB |
Output is correct |
| 16 |
Correct |
3 ms |
856 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 |
576 KB |
Output is correct |
| 4 |
Correct |
2 ms |
624 KB |
Output is correct |
| 5 |
Correct |
2 ms |
624 KB |
Output is correct |
| 6 |
Correct |
2 ms |
624 KB |
Output is correct |
| 7 |
Correct |
2 ms |
624 KB |
Output is correct |
| 8 |
Correct |
2 ms |
624 KB |
Output is correct |
| 9 |
Correct |
2 ms |
624 KB |
Output is correct |
| 10 |
Correct |
2 ms |
624 KB |
Output is correct |
| 11 |
Correct |
2 ms |
624 KB |
Output is correct |
| 12 |
Correct |
3 ms |
660 KB |
Output is correct |
| 13 |
Correct |
4 ms |
856 KB |
Output is correct |
| 14 |
Correct |
3 ms |
856 KB |
Output is correct |
| 15 |
Correct |
4 ms |
856 KB |
Output is correct |
| 16 |
Correct |
3 ms |
856 KB |
Output is correct |
| 17 |
Correct |
182 ms |
5356 KB |
Output is correct |
| 18 |
Correct |
176 ms |
6648 KB |
Output is correct |
| 19 |
Correct |
185 ms |
8044 KB |
Output is correct |
| 20 |
Correct |
182 ms |
9496 KB |
Output is correct |
| 21 |
Correct |
236 ms |
11324 KB |
Output is correct |
| 22 |
Correct |
176 ms |
12552 KB |
Output is correct |
| 23 |
Correct |
210 ms |
14124 KB |
Output is correct |
| 24 |
Correct |
190 ms |
15320 KB |
Output is correct |
| 25 |
Correct |
191 ms |
16816 KB |
Output is correct |
| 26 |
Correct |
195 ms |
18456 KB |
Output is correct |
