Min_cost_of_ropes.py

# User function Template for python3
import heapq


class Solution:
    def minCost(self, arr):
        heapq.heapify(arr)
        total_cost = 0
        while len(arr) > 1:
            first = heapq.heappop(arr)
            second = heapq.heappop(arr)
            cost = first+second
            total_cost += cost
            heapq.heappush(arr, cost)
        return total_cost