# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1244882 | bonic | Prosjek (COCI18_prosjek) | C++20 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n; cin >> n; vector<int> A(n);
for (int i = 0; i < n; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
double sum = ((double)A[0] + (double)A[1]) / 2.0;
for (int i = 2; i < n; i++) {
sum = (sum + (double)A[i]) / 2.0;
}
cout << fixed << setprecision(10) << sum;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |