# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112173 | Pajaraja | Sure Bet (CEOI17_sure) | C++17 | 81 ms | 5368 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;
double a[100001],b[100001],sa[100001],sb[100001];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%lf%lf",&a[i],&b[i]);
sort(a,a+n,greater<double>());
sort(b,b+n,greater<double>());
double sol=0;
for(int i=1;i<=n;i++) sa[i]=sa[i-1]+a[i-1];
for(int i=1;i<=n;i++) sb[i]=sb[i-1]+b[i-1];
int t1=0,t2=0;
while(t1<=n && t2<=n)
{
double a;
if(sb[t2]-t1-t2>sa[t1]-t1-t2) a=sa[t1]-t1-t2;
else a=sb[t2]-t1-t2;
if(sol<a) sol=a;
if(sa[t1]<sb[t2]) t1++;
else t2++;
}
printf("%.4lf",sol);
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... |