# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129971 | TadijaSebez | Sure Bet (CEOI17_sure) | C++11 | 226 ms | 3732 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 pb push_back
#define mp make_pair
#define ll long long
double L,R;
const int N=100050;
double l[N],r[N],sol;
int main()
{
int n,i,j;
scanf("%i",&n);
for(i=1;i<=n;i++) cin >> l[i] >> r[i];
sort(l+1,l+1+n);
sort(r+1,r+1+n);
i=n,j=n;int cnt=0;
while(i || j)
{
cnt++;
if(!i) R+=r[j--];
else if(!j) L+=l[i--];
else if(L<R) L+=l[i--];
else R+=r[j--];
sol=max(sol,min(L,R)-cnt);
}
//printf("%.4llf\n",(double)sol);
cout << fixed << setprecision(4) << sol << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |