def angryChildren(k, packets):
    packets.sort()
    mini = sys.maxsize
    for i in range(len(packets) - k + 1):
        st = i
        ed = i + k - 1
        mul = k - 1
        t = 0
        while st < ed:
            t += mul * (packets[ed] - packets[st])
            mul -= 2
            st += 1
            ed -= 1
        mini = min(t, mini)