Submission #69487296

---

Source Code Expand

from heapq import heapify, heappop, heappush


SIZE = 31


def solve(N, K, X, A):
    h = [(-float(a), 1) for a in A]
    heapify(h)

    while K:
        a, c = heappop(h)
        d = min(K, c)
        K -= d
        heappush(h, (a / 2, d * 2))
        if d != c:
            heappush(h, (a, c - d))

    for a, c in sorted(h):
        if X <= c:
            return -a
        X -= c


def main():
    T = int(input())
    for t in range(T):
        N, K, X = map(int, input().split())
        A = list(map(int, input().split()))
        ans = solve(N, K, X, A)
        print(ans)


main()

"""
とりあえず <<31したら整数で扱える

棒の最大値は二分探索で求められる→別にシミュレーションしてもいい…

棒の長さの種類はN+1しかないはず

"""

Submission Info

Judge Result