#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n;
long double a[N], b[N];
long double sa[N], sb[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i] >> b[i];
sa[i] = a[i] - 1;
sb[i] = b[i] - 1;
}
sort(sa + 1, sa + n + 1, greater<long double>());
sort(sb + 1, sb + n + 1, greater<long double>());
long double lo = 0.0F, hi = 1e8;
for (int ite = 1; ite <= 100; ite++) {
long double mid = (lo + hi) * 0.5F;
bool f = false;
long double a = 0, b = 0;
for (int x = 0, y = 0; x <= n; x++) {
while (y + 1 <= n && a - (y + 1) >= mid) {
y++;
b += sb[y];
}
f |= (a - y >= mid && b - x >= mid);
a += sa[x + 1];
}
if (f) {
lo = mid;
} else {
hi = mid;
}
}
cout << fixed << setprecision(4) << lo << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 11 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 12 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 13 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 14 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 15 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 16 |
Correct |
2 ms |
4444 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 9 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 10 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 11 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 12 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 13 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 14 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 15 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 16 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 17 |
Correct |
127 ms |
6484 KB |
Output is correct |
| 18 |
Correct |
117 ms |
8276 KB |
Output is correct |
| 19 |
Correct |
113 ms |
8076 KB |
Output is correct |
| 20 |
Correct |
108 ms |
8072 KB |
Output is correct |
| 21 |
Correct |
119 ms |
8448 KB |
Output is correct |
| 22 |
Correct |
107 ms |
7912 KB |
Output is correct |
| 23 |
Correct |
109 ms |
7936 KB |
Output is correct |
| 24 |
Correct |
113 ms |
8016 KB |
Output is correct |
| 25 |
Correct |
105 ms |
8068 KB |
Output is correct |
| 26 |
Correct |
117 ms |
8440 KB |
Output is correct |
