#include <bits/stdc++.h>
using namespace std;
double A[100005], B[100005];
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
int N; 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>());
int a = 0, b = 0;
double sa = 0, sb = 0, ans = 0;
while (a < N || b < N) {
if (a < N && b < N) {
if (min(sa + A[a], sb) > min(sa, sb + B[b])) sa += A[a++];
else sb += B[b++];
}
else if (a == N) sb += B[b++];
else sa += A[a++];
ans = max(ans, min(sa, sb) - a - b);
}
printf("%.4f", ans);
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
380 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
380 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
380 KB |
Output is correct |
| 8 |
Correct |
2 ms |
380 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
380 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
380 KB |
Output is correct |
| 8 |
Correct |
2 ms |
380 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
2 ms |
376 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
97 ms |
3292 KB |
Output is correct |
| 18 |
Correct |
97 ms |
3320 KB |
Output is correct |
| 19 |
Correct |
99 ms |
3320 KB |
Output is correct |
| 20 |
Correct |
97 ms |
3320 KB |
Output is correct |
| 21 |
Correct |
105 ms |
3612 KB |
Output is correct |
| 22 |
Correct |
97 ms |
3320 KB |
Output is correct |
| 23 |
Correct |
100 ms |
3436 KB |
Output is correct |
| 24 |
Correct |
102 ms |
3320 KB |
Output is correct |
| 25 |
Correct |
97 ms |
3320 KB |
Output is correct |
| 26 |
Correct |
106 ms |
3792 KB |
Output is correct |
