优先队列合并

def solve(____):
    import heapq
    arrays = [list(map(int, arr.split(____))) for arr in arrays.split(____)]
    result = []
    heap = []
    for i, arr in enumerate(____):
        if arr:
            heapq.heappush(heap, (____))
    while heap:
        val, arr_idx, elem_idx = heapq.heappop(____)
        result.append(____)
        if elem_idx + ____ < len(____):
            heapq.heappush(heap, (____))
    print('____'.join(map(____)))