# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65768 | naderjemel | Sure Bet (CEOI17_sure) | C++14 | 2 ms | 356 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;
const long long INF=2e9;
int main(){
int n; scanf("%d",&n);
vector<long long> as,bs;
for(int i=0;i<n;i++){
double a,b; scanf("%lf %lf",&a,&b); a*=10000; b*=10000;
long long A=a;
long long B=b;
as.push_back(A);
bs.push_back(B);
}
sort(as.begin(),as.end());
sort(bs.begin(),bs.end());
reverse(as.begin(),as.end());
reverse(bs.begin(),bs.end());
int i=0,j=0;
long long rs=0,us=0;
long long nowa=0,nowb=0;
while(i<n && j<n){
if(nowa<=nowb){
nowa+=as[i];
i++; us+=10000;
}
else{
nowb+=bs[j];
j++; us+=10000;
}
rs=max(rs,min(nowa-us,nowb-us));
}
printf("%.4lf\n", (double)rs/10000.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... |