# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
171947 | ToniB | Prosjek (COCI18_prosjek) | C++14 | 2 ms | 392 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 <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
double all[n];
for(int i = 0; i < n; ++i){
cin >> all[i];
}
sort(all, all + n);
double sol = (all[0] + all[1]) / 2;
for(int i = 2; i < n; ++i){
sol = (sol + all[i]) / 2;
}
cout << sol;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |