Question

#include #include using namespace std; // Returns minimum number of platforms reqquired int findPlatform(int arr[], int dep[], int n) { // Sort arrival and departure arrays sort(arr, arr + n); sort(dep, dep + n); // plat_needed indicates number of platforms // needed at a time int plat_needed = 1, result = 1; int i = 1, j = 0; // Similar to merge in merge sort to process // all events in sorted order while (i dep[j]) { plat_needed--; j++; } // Update result if needed if (plat_needed > result) result = plat_needed; } return result; } // Driver program to test methods of graph class 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; }

Answer 1

Answer:

http

Explanation:

provider is essential