(Solve in Dev c++) Given a schedule containing the arrival and departure time of trains in a station. Find the minimum number of platforms needed to avoid delay in any train’s arrival. The idea is to...

(Solve  in Dev c++)

Given a schedule containing the arrival and departure time of trains in a station. Find the minimum number of platforms needed to avoid delay in any train’s arrival.

The idea is to merge the arrival and deprature time of trains and consider them in sorted order. Maintain a counter to count the number of trains present at the station at any point. The counter also represents the total number of platforms needed at that time.

One special case needs to be handled – when two trains are scheduled to arrive and depart simultaneously, depart the train first.