题解 | #中位数# Python

中位数的一个python解法 >.<

T = int(input())
while T:
    key = input().split()
    n = int(key[0])
    k = int(key[1])
    a = input().split()
    a = [int(x) for x in a]

    a.sort()
    while k:
        a[-2] += a[-1]
        a.pop()
        k -= 1
    n = len(a)
    print(a[(n+1)//2-1])
    T -= 1