towerFrode

def towerFrode(bricks,nTower,time):

    bricks.sort(reverse=True)
    lengthBricks = len(bricks)

    if lengthBricks > nTower:
        Tower = [[] for i in range(0,nTower)]
        Height = [0] * nTower
        avgHeight = sum(bricks)/nTower

        k = 0
        for j in range(0,nTower):
            while Height[j] + bricks[k] < avgHeight:
                Tower[j].append(bricks[k])
                Height[j] = bricks[k] + Height[j]
                k = k + 1;

        for n in range(k,lengthBricks):
            lowest = Height.index(min(Height))
            Tower[lowest].append(bricks[n])
            Height[lowest] = bricks[n] + Height[lowest]

    return Tower