class Solve:
    def __init__(self):
        self.N = int(input())
        self.L = [int(i) for i in input().split()]
        self.K = int(input())

        self.l, self.r = max([l/self.K for l in self.L]), min(max(self.L)+1, sum(self.L)/self.K+1)

    def check(self, l):
        k = 0
        L = [s for s in self.L if s >= l]
        while(L and k < self.K):
            # dk1, dk2 = len(L), L[0] // l
            # k += dk2
            k += L.pop() // l

            # if dk1 > dk2:
            #     k += dk1
            #     L = [s - l for s in L if s >= l*2]
            # else:
            #     k += dk2
            #     L.pop()
        return True if k >= self.K else False

    def solve(self):
        while self.r - self.l > 10**-9:
            m = (self.l + self.r) / 2
            if self.check(m):
                self.l = m
            else:
                self.r = m
        return self.l

print(Solve().solve())