Meeting rooms with delayed starts: the busiest room

There are n rooms numbered from 0 and a list of meetings with distinct start times. Each meeting takes the free room with the lowest number; if none is free, it waits for the earliest room to free up and keeps its original duration. Return the room that held the most meetings (lowest number on ties). Simulate with two heaps.