Feel free to checkout the image source at the bottom of this page for the original problem description :)
Imagine you're tasked with managing the guest list for an exclusive, high-profile event. The attendees are arriving, eager to get inside, but there’s a process they all must go through: an ID check. However, the entry point can only accommodate a limited number of people at a time, and each guest takes a different amount of time to verify, depending on their unique situation. Your challenge is to ensure that every guest is checked in efficiently, taking into account the capacity of the queue and the time each guest needs to get through. To solve this, you're designing a system where you must calculate the exact moment when the final guest will complete their ID check, making sure the process flows smoothly without unnecessary delays.
Example 1:
Input: lamps = [[1, 7], [5, 11], [7, 9]], points = [7, 1, 5, 10, 9, 15]
Output: [3, 1, 2, 1, 2, 0]
Explanation:n/a
TO-DO


input:
output: