trainingtime.py

import sys

def solve(n,p,s):
    s = sorted(s, reverse=True)
    min_time = sys.maxsize
    for i in range(n - p + 1):
        sub = s[i:i+p]
        sub_time = p  * s[i] - sum(sub)
        if(sub_time <= min_time):
            min_time = sub_time
    return min_time


def resolve():
    T = int(input())
    for t in range(T):
        n,p = [int(i) for i in input().split()]
        s = [int(i) for i in input().split()]
        res = (solve(n, p, s))
        print("case #" + str(t + 1) + ": " + str(res))

resolve()