oj.uz

Submission #83314

# Submission time Handle Problem Language Result Execution time Memory
83314 2018-11-06T22:46:00 Z josiftepe Prosjek (COCI18_prosjek) C++14
50 / 50
 2 ms 640 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll inf = (1LL << 60LL);
const int maxn = 1e5 + 10;
int n;
int arr[maxn];
int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
    cin >> n;
    for(int i =0 ; i < n; i ++){
        cin >> arr[i];
    }
    sort(arr, arr + n);
    if(n == 1){
        cout << arr[0] << endl;
        return 0;
    }
    double ret = ((double)arr[0] + (double)arr[1]) / (double)2;
    for(int i = 2; i < n; i ++){
        ret += (double)arr[i];
        ret /= (double)2;
    }
    printf("%.6f\n", ret);
        return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 408 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 2 ms 456 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 2 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct