#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
typedef long long ll;
const int C = 1e4;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
ll a[n+1] = {}, b[n+1] = {};
rep (i,0,n-1) {
double x, y; cin >> x >> y;
a[i] = C*x;
b[i] = C*y;
}
sort (a, a+n, greater<ll>());
sort (b, b+n, greater<ll>());
ll lo = 0, hi = 1e13;
while (lo<hi) {
ll mid = (lo+hi+1)/2, id = 0, s1 = 0, s2 = 0, suc = 0;
rep (i,0,n) {
if (min(s1,s2)-C*(i+id)>=mid) {
suc = 1;
break;
}
s1 += a[i];
while (id < n && s2-C*(i+id)<mid) {
s2 +=b[id];
++id;
}
}
if (suc) lo = mid;
else hi = mid-1;
}
cout << fixed << setprecision(4) << (double)lo/1e4 << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |