제출 #239669

#제출 시각아이디문제언어결과실행 시간메모리
239669VEGAnnProsjek (COCI18_prosjek)C++14
50 / 50
5 ms384 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const int N = 110;
ld ans;
int n, a[N];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 0; i < n; i++)
        cin >> a[i];

    sort(a, a + n);

    ans = (ld(a[0]) + ld(a[1])) / 2.0;

    for (int i = 2; i < n; i++)
        ans = (ans + ld(a[i])) / 2.0;

    cout << fixed << setprecision(10) << ans;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...