# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
956957 | FEDIKUS | Sure Bet (CEOI17_sure) | C++17 | 108 ms | 3728 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 int MAX_N = 100100;
int n;
double A[MAX_N], B[MAX_N];
int main()
{
// Ulaz
cin>>n;
for(int i=0;i<n;i++)
{
cin>>A[i]>>B[i];
}
// Obrada
sort(A, A+n);
sort(B, B+n);
double rez = 0;
double profit = 0, loss = 0;
double sumA = 0, sumB = 0;
int a = n-1, b = n-1;
while(a != -1 or b != -1)
{
loss++;
if(sumA <= sumB)
{
if(a==-1) break;
sumA += A[a];
a--;
}
else
{
if(b==-1) break;
sumB += B[b];
b--;
}
if(min(sumA,sumB) - loss > rez)
{
rez = min(sumA,sumB) - loss;
}
}
// Izlaz
cout<<fixed<<showpoint<<setprecision(4)<<rez<<endl;
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... |