oj.uz

Submission #49837

# Submission time Handle Problem Language Result Execution time Memory
49837 2018-06-03T16:48:58 Z WLZ Prosjek (COCI18_prosjek) C++17
50 / 50
 3 ms 716 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    priority_queue<double, vector<double>, greater<double>> pq;
    for (int i = 0; i < n; i++) {
        int val;
        cin >> val;
        pq.push((double) val);
    }
    while (pq.size() > 1u) {
        double d1 = pq.top(); pq.pop();
        double d2 = pq.top(); pq.pop();
        pq.push((d1 + d2) / 2.0);
    }
    cout << fixed << setprecision(20) << pq.top() << '\n';
    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 416 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 572 KB Output is correct
7 Correct 2 ms 588 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct