4주차. solution - 홍광필

def minimumAbsoluteDifference(arr):
    arr.sort()


    min = 1000000000
    
    for i in range(1, len(arr)):
        diff = abs(arr[i] - arr[i-1])
        if diff < min:
            min = diff
    
    return min

def getMinimumCost(k, c):

    c.sort()

    sum_price = 0
    
    for i in range(len(c)):
        original_price = c[-1 * (i+1)]
        previous_purchase = math.floor(i / k)

        sum_price += (previous_purchase + 1) * original_price

    return sum_price