# Minimum Number of Platforms Required for a Railway/Bus Station | Set 2 (Map based approach)

Given arrival and departure times of all trains that reach a railway station, find the minimum number of platforms required for the railway station so that no train waits. We are given two arrays which represent arrival and departure times of trains that stop.

Examples:

Input: arr[] = {9:00, 9:40, 9:50, 11:00, 15:00, 18:00} dep[] = {9:10, 12:00, 11:20, 11:30, 19:00, 20:00} Output: 3 There are at-most three trains at a time (time between 11:00 to 11:20)

We have already discussed its simple and sorting based solutions in below post.

Minimum Number of Platforms Required for a Railway/Bus Station.

In this post, we are inserting all the arrival and departure times in a multimap. The first value of element in multimap tells the arrival/departure time and second value tells whether it’s arrival or departure represented by ‘a’ or ‘d’ respectively.

If its arrival then do increment by 1 otherwise decrease value by 1. If we are taking the input from STDIN then we can directly insert the times in the multimap and no need to store the times in the array.

`// Program to find minimum number of platforms ` `// required on a railway station ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `int` `findPlatform(` `int` `arr[], ` `int` `dep[], ` `int` `n) ` `{ ` ` ` `// Insert all the times (arr. and dep.) ` ` ` `// in the multimap. ` ` ` `multimap<` `int` `, ` `char` `> order; ` ` ` `for` `(` `int` `i = 0; i < n; i++) { ` ` ` ` ` `// If its arrival then second value ` ` ` `// of pair is 'a' else 'd' ` ` ` `order.insert(make_pair(arr[i], ` `'a'` `)); ` ` ` `order.insert(make_pair(dep[i], ` `'d'` `)); ` ` ` `} ` ` ` ` ` `int` `result = 0; ` ` ` `int` `plat_needed = 0; ` ` ` ` ` `multimap<` `int` `, ` `char` `>::iterator it = order.begin(); ` ` ` ` ` `// Start iterating the multimap. ` ` ` `for` `(; it != order.end(); it++) { ` ` ` ` ` `// If its 'a' then add 1 to plat_needed ` ` ` `// else minus 1 from plat_needed. ` ` ` `if` `((*it).second == ` `'a'` `) ` ` ` `plat_needed++; ` ` ` `else` ` ` `plat_needed--; ` ` ` ` ` `if` `(plat_needed>result) ` ` ` `result = plat_needed; ` ` ` `} ` ` ` `return` `result; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `arr[] = { 900, 940, 950, 1100, 1500, 1800 }; ` ` ` `int` `dep[] = { 910, 1200, 1120, 1130, 1900, 2000 }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` `cout << ` `"Minimum Number of Platforms Required = "` ` ` `<< findPlatform(arr, dep, n); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

Output:

3

This article is contributed by **Jatin Goyal**. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

## Recommended Posts:

- Minimum number of changes required to make the given array an AP
- Minimum deletions required such that any number X will occur exactly X times
- Minimum number of swaps required to sort an array
- Minimum number of swaps required to sort an array | Set 2
- Minimum total cost incurred to reach the last station
- Minimum number of swaps required for arranging pairs adjacent to each other
- Minimum number of towers required such that every house is in the range of at least one tower
- Minimum number of segments required such that each segment has distinct elements
- Minimum number of given operations required to reduce the array to 0 element
- Find the minimum number of operations required to make all array elements equal
- Minimum number of given operations required to convert a permutation into an identity permutation
- Minimum Swaps required to group all 1's together
- Minimum boxes required to carry all gifts
- Minimum operations required to change the array such that |arr[i] - M| <= 1
- Minimum operations required to remove an array