3538. Merge Operations for Minimum Travel Time

You are given a straight road of length l km, an integer n, an integer k, and two integer arrays, position and time, each of length n. The array position lists the positions (in km) of signs in strictly increasing order (with position[0] = 0 and position[n - 1] = l). Each time[i] represents the time (in minutes) required to travel 1 km between position[i] and position[i + 1]. You must perform e