# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086940 | ZeroCool | Sure Bet (CEOI17_sure) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define int long long
#define ld long double
#define crash assert(69 == 420)
const int MOD = 1e9 + 7;
const int INF = 1e17;
const int N = 2e5 + 20;
const int LOG = 20;
signed main(){ios_base::sync_with_stdio(false);cin.tie(0);
int n;
cin>>n;
ld A[n], B[n];
for(int i = 0;i < n;i++)cin>>A[i]>>B[i];
sort(A, A + n);
sort(B, B + n);
reverse(A, A + n);
reverse(B, B + n);
ld ans = 0;
ld x = 0, y = 0;
int i = 0,j = 0;
while(i < n || j < n){
if(i < n && (j == n || x < y))x += A[i++];
else y += B[j++];
ans = max(ans, min(x, y) - i - j);
?/cout<<i<<" "<<j<<endl;
}
cout<<fixed<<setprecision(12)<<ans;
}