#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(),(x).end()
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define debug(x) cerr << #x << ": " << x << endl;
const ll MAXN = 1e6 + 10;
const ll HMM = 1e4;
int n;
ll A[MAXN], B[MAXN], ans, ps[MAXN];
inline void f() {
for (int i = 1; i <= n; i++)
ps[i] = ps[i - 1] + B[i];
ll s = 0;
for (int i = 1; i <= n; i++) {
s += A[i];
if (s > ps[n]) break;
int ind = lower_bound(ps, ps + n + 1, s) - ps;
ans = max(ans, s - HMM * (ind + i));
assert(ps[ind] >= s);
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
double a, b;
cin >> a >> b;
A[i] = round(a * HMM);
B[i] = round(b * HMM);
}
sort(A + 1, A + n + 1, greater<ll>());
sort(B + 1, B + n + 1, greater<ll>());
f();
swap(A, B);
f();
debug(ans)
cout << setprecision(4) << fixed << double(ans) / HMM << endl;
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 2 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 3 |
Correct |
10 ms |
15984 KB |
Output is correct |
| 4 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 5 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 6 |
Correct |
10 ms |
15960 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 2 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 3 |
Correct |
10 ms |
15984 KB |
Output is correct |
| 4 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 5 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 6 |
Correct |
10 ms |
15960 KB |
Output is correct |
| 7 |
Correct |
10 ms |
15920 KB |
Output is correct |
| 8 |
Correct |
11 ms |
15948 KB |
Output is correct |
| 9 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 10 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 11 |
Correct |
11 ms |
15928 KB |
Output is correct |
| 12 |
Correct |
12 ms |
15960 KB |
Output is correct |
| 13 |
Correct |
11 ms |
15956 KB |
Output is correct |
| 14 |
Correct |
14 ms |
15956 KB |
Output is correct |
| 15 |
Correct |
15 ms |
15956 KB |
Output is correct |
| 16 |
Correct |
10 ms |
15956 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 2 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 3 |
Correct |
10 ms |
15984 KB |
Output is correct |
| 4 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 5 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 6 |
Correct |
10 ms |
15960 KB |
Output is correct |
| 7 |
Correct |
10 ms |
15920 KB |
Output is correct |
| 8 |
Correct |
11 ms |
15948 KB |
Output is correct |
| 9 |
Correct |
9 ms |
15956 KB |
Output is correct |
| 10 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 11 |
Correct |
11 ms |
15928 KB |
Output is correct |
| 12 |
Correct |
12 ms |
15960 KB |
Output is correct |
| 13 |
Correct |
11 ms |
15956 KB |
Output is correct |
| 14 |
Correct |
14 ms |
15956 KB |
Output is correct |
| 15 |
Correct |
15 ms |
15956 KB |
Output is correct |
| 16 |
Correct |
10 ms |
15956 KB |
Output is correct |
| 17 |
Correct |
88 ms |
18096 KB |
Output is correct |
| 18 |
Correct |
87 ms |
18092 KB |
Output is correct |
| 19 |
Correct |
91 ms |
18044 KB |
Output is correct |
| 20 |
Correct |
95 ms |
18116 KB |
Output is correct |
| 21 |
Correct |
91 ms |
18408 KB |
Output is correct |
| 22 |
Correct |
86 ms |
18036 KB |
Output is correct |
| 23 |
Correct |
92 ms |
18032 KB |
Output is correct |
| 24 |
Correct |
96 ms |
18120 KB |
Output is correct |
| 25 |
Correct |
87 ms |
18100 KB |
Output is correct |
| 26 |
Correct |
91 ms |
18496 KB |
Output is correct |
