Problem:


Score : 300 points

Problem Statement

You have a pot and N ingredients. Each ingredient has a real number parameter called value, and the value of the i-th ingredient (1 \leq i \leq N) is v_i.

When you put two ingredients in the pot, they will vanish and result in the formation of a new ingredient. The value of the new ingredient will be (x + y) / 2 where x and y are the values of the ingredients consumed, and you can put this ingredient again in the pot.

After you compose ingredients in this way N-1 times, you will end up with one ingredient. Find the maximum possible value of this ingredient.

Constraints

2 \leq N \leq 50

1 \leq v_i \leq 1000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
v_1 v_2 \ldots v_N

Output

Print a decimal number (or an integer) representing the maximum possible value of the last ingredient remaining.

Your output will be judged correct when its absolute or relative error from the judge's output is at most 10^{-5}.

Sample Input 1

2
3 4

Sample Output 1

3.5

If you start with two ingredients, the only choice is to put both of them in the pot. The value of the ingredient resulting from the ingredients of values 3 and 4 is (3 + 4) / 2 = 3.5.

Printing 3.50001, 3.49999, and so on will also be accepted.

Sample Input 2

3
500 300 200

Sample Output 2

375

You start with three ingredients this time, and you can choose what to use in the first composition. There are three possible choices:

Use the ingredients of values 500 and 300 to produce an ingredient of value (500 + 300) / 2 = 400. The next composition will use this ingredient and the ingredient of value 200, resulting in an ingredient of value (400 + 200) / 2 = 300.

Use the ingredients of values 500 and 200 to produce an ingredient of value (500 + 200) / 2 = 350. The next composition will use this ingredient and the ingredient of value 300, resulting in an ingredient of value (350 + 300) / 2 = 325.

Use the ingredients of values 300 and 200 to produce an ingredient of value (300 + 200) / 2 = 250. The next composition will use this ingredient and the ingredient of value 500, resulting in an ingredient of value (250 + 500) / 2 = 375.

Thus, the maximum possible value of the last ingredient remaining is 375.

Printing 375.0 and so on will also be accepted.

Sample Input 3

5
138 138 138 138 138

Sample Output 3

138



Sample input:
2
3 4


Sample output:
3.5

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array, use [[0] * N for _ in range(N)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    N = int(r())
    V = R()
    heapify(V)
    for _ in range(N-1):
        a = heappop(V)
        b = heappop(V)
        heappush(V, (a+b)/2)
    print(*V)
    
    
    

    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from heapq import heapify,heappop,heappush
N = int(input())
V = list(map(int,input().split()))
heapify(V)
while len(V) > 1:
    a = heappop(V)
    b = heappop(V)
    heappush(V,(a+b)/2)
print(V[0])

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    N = INT()
    V = sorted(LIST())
    tmp = V[0]
    for i in range(1, N):
        tmp = (tmp + V[i])/2
    print(tmp)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
V = list(map(int, input().split()))
V.sort()
ans = V[0]
for i in range(1,N):
  ans = (ans+V[i])/2
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
v = sorted(list(map(int, input().split())))

ans = 0
for i in range(1, N):
  v[i] = ((v[i] + v[i-1])/2)
print (v[-1])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

A = int(input())
L = [int(v) for v in input().split()]
L.sort()

for i in range(A - 1):
    L[i] = (L[i] + L[i + 1]) / 2
    L[i + 1] = 0

    L.sort()

print(L[-1])

Submission status: Accepted

Solution code:
N = int(input())
v = list(map(int,input().split()))

v_s = sorted(v)

tmp = v_s[0]
for i in range(1,N):
    tmp = (tmp +v_s[i])/2

print(tmp)

Submission status: Accepted

Solution code:
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces1203A_live
gi = lambda : list(map(int,input().split()))
n, = gi()
l = sorted(gi())
ans = l[0]
for k in range(1, n):
	ans = (ans + l[k]) / 2
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
l = sorted(map(int, input().split()))
res = (l[0] + l[1]) / 2
for i in range(2, n):
    res = (res + l[i]) / 2
print(res)

Submission status: Accepted

Solution code:
N = int(input())
v = sorted([int(i) for i in input().split()])

ans = v[0]
for i in range(1, N):
    ans = (ans + v[i]) / 2
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
v=list(map(int,input().split()))
v.sort()

ans=(v[0]+v[1])*0.5
if n==2:
    print(ans)
else:
    for i in v[2:]:
        ans=(ans+i)*0.5
    print(ans)

Submission status: Accepted

Solution code:
n = int(input())
b = [float(i) for i in input().split()]
b.sort()
c = 0

for i in range(len(b)-1):
    b[i+1] = (b[i] + b[i+1])/2
print(b[-1])

Submission status: Accepted

Solution code:
n=int(input())
v=sorted(list(map(int,input().split())))
a=v[0]
for i in range(n-1):
    a=(a+v[i+1])/2
print(a)

Submission status: Accepted

Solution code:
n = int(input())
l = list(map(int, input().split()))
l.sort()
prev = l[0]
for i in range(1,n):
    prev = (prev + l[i]) / 2
print(prev)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

N = int(input())
V = list(map(int, input().split()))

V.sort()
ans = [(V[0] + V[1]) / 2] 
for i in range(2, N):
    ans.append((ans[-1] + V[i]) / 2)
print(ans[-1])

Submission status: Accepted

Solution code:
from functools import reduce

N = int(input())
A = map(float, input().split())

A = sorted(A)

A = reduce(lambda x, y: (x + y) / 2, A)

print(A)

Submission status: Accepted

Solution code:
import sys
mod = 1000000007
def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())
def input(): return sys.stdin.readline()
def main():
    n = int(input())
    v = get_array()
    v.sort()
    s = (v[0] + v[1])/2
    for i in range(2, n):   s = (s + v[i])/2
    print(s)
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N=int(input())
v_list=[int(x) for x in input().split()]
v_sort=sorted(v_list)
        
for i in range(N):
    if len(v_sort)<2:
        break
    else:
        v_sort=[(v_sort[0]+v_sort[1])/2]+v_sort[2:]

print(v_sort[0])

Submission status: Accepted

Solution code:
N = int(input())
V = [int(i) for i in input().split()]
V_sort = sorted(V)

ans = 0
for i in range(len(V)-1):
    if i ==0:
        ans = (V_sort[i] + V_sort[i+1])/2
    else:
        ans = (ans + V_sort[i+1])/2
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
v = list(map(int, input().split(" ")))
v = sorted(v)

s = v[0] / (2 ** (N - 1))
s += sum(v[1 + n] / (2 ** (N - 1 - n)) for n in range(N - 1))
print(s)

Submission status: Accepted

Solution code:
N=int(input())
V=sorted(map(int,input().split()))
for i in range(N-1):
    V[i+1]=(V[i]+V[i+1])/2
print(V[-1])

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int, input().split()))

while 1 < len(v):
    v = sorted(v)
    v = [((v[0]+v[1])/2)] + v[2:]

print(v[0])

Submission status: Accepted

Solution code:
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[0]
for i in range(1,n):
    ans=(ans+v[i])/2
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int,input().split()))

v.sort()

s = v[0]
for i in range(1,n) :
    s = (s + v[i])/2

print(s)

Submission status: Accepted

Solution code:
import sys

def resolve():
    N = int(input())
    V = list(map(int, input().split()))
    V.sort()
    tmp = 0
    for v in V:
        if tmp == 0:
            tmp = v
        else:
            tmp = (tmp + v) / 2.0

    print(tmp)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int, input().split()))

v.sort()

for i in range(n-1):
    v = [(v[0]+v[1])/2] + v[2:]

print(v[0])

Submission status: Accepted

Solution code:
N = int(input())
v = list(map(int, input().split()))
v1 = sorted(v, reverse = True)
sum1 = 0

for i in range(N-1):
  value = v1[i]/(2 ** (i+1))
  sum1 += value

sum1 += v1[-1]/(2 ** (N-1))

print(sum1)

Submission status: Accepted

Solution code:
def c_alchemist():
    N = int(input())
    V = [int(i) for i in input().split()]
    v = sorted(V, reverse=True)
    while len(v) > 1:
        x = v.pop()
        y = v.pop()
        v.append((x + y) / 2)
    return sum(v)

print(c_alchemist())

Submission status: Accepted

Solution code:
N = int(input())
v = list(map(int, input().split()))

v.sort()
count = v[0]

for i in range(1, N):
  count = (count + v[i]) / 2
  
print(count)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.sort()
sum = a[0]
for i in range(1,n):
  sum = (sum+a[i])/2
print(sum)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
A.sort()

for i in range(N-1):
  a = (A[0]+A[1])/2
  A = [a]+A[2:]
  A.sort()
print(a)

Submission status: Accepted

Solution code:
from heapq import *

n=int(input())
vl=list(map(int,input().split()))

heapify(vl)
for i in range(n-1):
    x=heappop(vl)
    y=heappop(vl)
    heappush(vl,(x+y)/2)
print(sum(vl))

Submission status: Accepted

Solution code:
N = int(input())
v = map(int, input().split())

sorted_v = sorted(v)

cook = sorted_v[0]

for i in range(1, N):
    cook = (cook + sorted_v[i]) / 2

print(cook)

Submission status: Accepted

Solution code:
N = int(input())
V = list(map(int, input().split()))

V = sorted(V)

ans = 0
tmp = V[0]
for i in range(1, N):
    tmp = (V[i] + tmp)/2
    if i == N-1:
        ans = tmp

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
  a[1]=(a[0]+a[1])/2
  a=a[1:]
print(a[0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
v = sorted(map(int, input().split()))
s = v[0]
for x in v[1:]:
    s = (s + x) / 2
print(s)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

i  = lambda: int(input())
li = lambda: list(map(int, input().split()))

N = i()
V = sorted(li())

count = (V[0] + V[1]) / 2

for i in range(2, N):
  count = (count + V[i]) / 2

print(count)

Submission status: Accepted

Solution code:
from collections import deque

N = int(input())
v = list(map(int, input().split()))
v.sort()

V = deque(v)
while len(V) > 1:
    a = V.popleft()
    b = V.popleft()
    V.appendleft((a + b) / 2)

print(V.pop())

Submission status: Accepted

Solution code:
N = int(input())
V = list(map(int, input().split()))
V.sort()
while len(V) > 1:
    V.append((V[0]+V[1])/2)
    V.pop(0)
    V.pop(0)
    V.sort()
print(V[0])

Submission status: Accepted

Solution code:
N = int(input())
v = [int(i) for i in input().split()]

v.sort()
ans = v[0]
for n in range(N-1):
    ans += v[n+1]
    ans /= 2

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
V=sorted(list(map(int,input().split())))
L=[V[0]]
for i in range(1,n):
    L.append((L[-1]+V[i])/2)
print(L[-1])

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))


A.sort()

hoge = A[0]
for i in range(N-1):
    hoge = (hoge + A[i+1])/2
print(hoge)

Submission status: Accepted

Solution code:
n = int(input())
v = sorted(list(map(int,input().split())))

ans = v[0]
for i in range(1,n):
	ans = ans/2 + v[i]/2
print(ans)

Submission status: Accepted

Solution code:

N = int(input())
V = list(map(int,input().split()))

V.sort()
val = V[0]
for v in V[1:]:
    val = (val+v)/2
print(val)

Submission status: Accepted

Solution code:
N = int(input())
v = list(map(int, input().split()))
v.sort()
res = v[0]
for i in range(1, N):
  res = (res + v[i]) / 2
print(res)

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())
v_lst = list(map(int, input().split()))

v_lst.sort()
ans = (v_lst[0] + v_lst[1])/2

for i in range(2, N):
    ans = (ans + v_lst[i])/2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
v = [int(i) for i in input().split()]
v.sort()
ans = (v[0] + v[1]) / 2
for i in range(2,n):
    ans = (ans + v[i]) / 2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int, input().split()))
v.sort()

while len(v) > 1:
    a = v.pop(0)
    b = v.pop(0)
    v.append((a + b) / 2)
    v.sort()
print(v[0])

Submission status: Accepted

Solution code:
n=int(input())
v=list(map(int,input().split()))
v.sort()
for i in range(n-1):
  v[i+1]=(v[i]+v[i+1])/2
print(v[-1])

Submission status: Accepted

Solution code:
n=int(input())
v=list(map(int,input().split()))

v.sort()
ans=0

for i in range(n-1):
    v[i+1]=(v[i]+v[i+1])/2
    v[i]=0

print(v[n-1])

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int, input().split()))
v.sort()
p = v[0]
for item in v[1:]:
    p = (item + p) / 2
print(p)

Submission status: Accepted

Solution code:
N = int(input())
V = map(int, input().split())
sorted_V = sorted(V)

ans = sorted_V[0]
for i in range(1, N):
    ans = (ans + sorted_V[i]) / 2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = [int(ii) for ii in input().split()]
a = sorted(a)

res = (a[0]+a[1])/2.0
for i in range(2, n):
    res = (res+a[i])/2.0

print(res)

Submission status: Accepted

Solution code:
n=int(input())
s=0.0
p=input().rstrip().split(' ')
p.sort(key=int)
i=0;
while(i<len(p)):
    if i==0:
        A=int(p[i])
        B=int(p[i+1])
        F=(A+B)/2;
        i+=2;
    else:
        F=(F+int(p[i]))/2;
        i+=1;
print(F)

Submission status: Accepted

Solution code:
N = int(input())
Vs = list(map(int, input().split()))

Vs.sort()
for i in range(1, N):
    Vs[0] = (Vs[0] + Vs[1]) / float(2)
    Vs.pop(1)
    Vs.sort()
print(Vs[0])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int,input().split()))
a.sort()

while(len(a) > 1):
	su = (a[0] + a[1])/2
	del a[0]
	del a[0]
	a.append(su)
	a.sort()

print(a[0])

Submission status: Accepted

Solution code:
import math
n = int(input())
v = list(map(int, input().split()))
v.sort()
#vは小さい順
for i in range(n-1):
    v[0] = (v[0]+v[1])/2
    v[1] = 1001
    v.sort()
print(v[0])

Submission status: Accepted

Solution code:
n = int(input())
v = sorted(list(map(int, input().split())))

ans = v[0]
for i in range(1, n):
    ans = (ans + v[i]) / 2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
v = list(map(int,input().split()))
v.sort()
ans = v[0]
for i in range(1,n):
    ans = (ans + v[i])/2

print(ans)

Submission status: Accepted

Solution code:
from functools import reduce


def ave(a, b):
    return (a + b) / 2


n = int(input())
v = list(map(int, input().split()))

v.sort()

print(reduce(ave, v))

Submission status: Accepted

Solution code:
n = int(input())
v = [int(i) for i in input().split()]
vv = sorted(v)
for i in range(1,n):
    vv[i] = (vv[i] + vv[i-1]) /2
print(vv[n-1])

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
t = a[0]
for i in range(1, n):
  t = (t+a[i])/2

print(t)

Submission status: Accepted

Solution code:
N = int(input())
v = list(map(int,input().split(' ')))

v.sort()
ans = (v[0]+v[1])/2

for v in v[2:]:
	ans = (ans + v)/2

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
a.sort()
sol = 0
for i in range(n - 1):
    a[i + 1] = (a[i] + a[i + 1]) / 2
print(a[n - 1])