oj.uz

Submission #239669

# Submission time Handle Problem Language Result Execution time Memory
239669 2020-06-17T06:51:24 Z VEGAnn Prosjek (COCI18_prosjek) C++14
50 / 50
 5 ms 384 KB 
#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;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct