# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76991 | farukkastamonuda | Prosjek (COCI18_prosjek) | C++14 | 2 ms | 632 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>
#define li 300005
using namespace std;
int n;
double x;
multiset<double> s;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lf",&x);
s.insert(x);
}
while((int)s.size()>1){
// cout<<"SIZE:"<<(int)s.size()<<endl;
auto it=s.begin();
double tut1=*it;
auto it2=it;
it2++;
double tut2=*it2;
s.erase(it);
s.erase(it2);
s.insert((tut1+tut2)/2);
}
printf("%.6lf",*s.begin());
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |