Kick Start 2019 (Round A, problem #1)

task1_round_A.py

def solve(students_needed, skills):
    skills.sort()
    min_hours = float('+inf')

    for i in range(0, len(skills) - students_needed + 1):
        _range = skills[i: i + students_needed]
        hours_needed = (max(_range) * students_needed) - sum(_range)
        if min_hours > hours_needed:
            min_hours = hours_needed
    return min_hours


def main():
    T = int(input())
    for case_n in range(1, T + 1):
        N, P = map(int, raw_input().split(' '))
        Si = map(int, raw_input().split(' '))
        result = solve(P, Si)
        print 'Case %s: %s' % (case_n, result)
main()