#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n;
double a[N],b[N];
long long s[N];
bool check(long long lim)
{
long long cur=0;
for(int i=1;i<=n;i++)
{
cur+=a[i];
long long mx=(cur-lim)/1000000000-i;
if(mx<0) continue;
mx=min(mx,1ll*n);
if(s[mx]-1ll*i*1000000000>=lim) return true;
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
a[i]*=1000000000;
b[i]*=1000000000;
}
sort(a+1,a+n+1);
sort(b+1,b+n+1);
reverse(a+1,a+n+1);
reverse(b+1,b+n+1);
for(int i=1;i<=n;i++) s[i]=max(s[i-1],s[i-1]+(long long)b[i]-1000000000);
long long l=1,r=1e18,res=0;
while(l<=r)
{
long long mid=(l+r)/2;
if(check(mid))
{
res=mid;
l=mid+1;
}
else r=mid-1;
}
cout<<fixed<<setprecision(4)<<1.0*res/1000000000;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
2 ms |
384 KB |
Output is correct |
| 13 |
Correct |
2 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| 16 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
0 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
0 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
2 ms |
384 KB |
Output is correct |
| 13 |
Correct |
2 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| 16 |
Correct |
2 ms |
384 KB |
Output is correct |
| 17 |
Correct |
121 ms |
2680 KB |
Output is correct |
| 18 |
Correct |
128 ms |
4088 KB |
Output is correct |
| 19 |
Correct |
134 ms |
4088 KB |
Output is correct |
| 20 |
Correct |
132 ms |
4076 KB |
Output is correct |
| 21 |
Correct |
142 ms |
4600 KB |
Output is correct |
| 22 |
Correct |
123 ms |
4116 KB |
Output is correct |
| 23 |
Correct |
124 ms |
4088 KB |
Output is correct |
| 24 |
Correct |
128 ms |
4088 KB |
Output is correct |
| 25 |
Correct |
128 ms |
4216 KB |
Output is correct |
| 26 |
Correct |
137 ms |
4472 KB |
Output is correct |
