How to Solve Time to Cross a Bridge Problem

There are k workers who want to move n boxes from the right (old) warehouse to the left (new) warehouse. You are given the two integers n and k, and a 2D integer array time of size k x 4 where time[i] = [righti, picki, lefti, puti]. The warehouses are separated by a river and connected by a bridge. Initially, all k workers are waiting on the left side of the bridge. To move the boxes, the ith worker can do the following: The ith worker is less efficient than the jth worker if either condition is met: The following rules regulate the movement of the workers through the bridge: Return the elapsed minutes at which the last box reaches the left side of the bridge.