#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
double a[N],b[N],sumA[N],sumB[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i] >> b[i];
sort(a + 1,a + n + 1,greater<double>());
sort(b + 1,b + n + 1,greater<double>());
sumA[0] = 0,sumB[0] = 0;
for (int i = 1; i <= n; i++) {
sumA[i] = sumA[i - 1] + a[i];
sumB[i] = sumB[i - 1] + b[i];
}
int j = 1;
double ans = 0;
for (int i = 1; i <= n; i++) {
while (j <= n && min(sumA[i],sumB[j]) - i - j <= min(sumA[i],sumB[j + 1]) - i - j - 1) j++;
ans = max(ans,min(sumA[i],sumB[j]) - i - j);
}
cout << fixed << setprecision(4) << ans << "\n";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2536 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2508 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2652 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2536 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2508 KB |
Output is correct |
| 17 |
Correct |
58 ms |
4812 KB |
Output is correct |
| 18 |
Correct |
57 ms |
4756 KB |
Output is correct |
| 19 |
Correct |
58 ms |
4752 KB |
Output is correct |
| 20 |
Correct |
62 ms |
4976 KB |
Output is correct |
| 21 |
Correct |
61 ms |
5200 KB |
Output is correct |
| 22 |
Correct |
58 ms |
4944 KB |
Output is correct |
| 23 |
Correct |
58 ms |
4688 KB |
Output is correct |
| 24 |
Correct |
58 ms |
4852 KB |
Output is correct |
| 25 |
Correct |
58 ms |
4688 KB |
Output is correct |
| 26 |
Correct |
60 ms |
5288 KB |
Output is correct |
