oj.uz

Submission #650442

# Submission time Handle Problem Language Result Execution time Memory
650442 2022-10-13T18:26:13 Z ali72 Prosjek (COCI18_prosjek) C++17
50 / 50
 1 ms 324 KB 
#include <bits/extc++.h>
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
void ALI_72(){
    int n;
    cin >> n;
    double a[n];
    for(int i = 0;i < n; ++i) cin >> a[i];
    sort(a, a+ n);
    for(int i = 1;i < n; ++i){
        a[i] = (a[i] + a[i - 1]) / 2;
    }
    cout << fixed << showpoint << setprecision(6) << a[n - 1] << '\n';
}

signed main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        ALI_72();
    }

}

Subtask #1
50.0 / 50.0

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