Minimum_Platforms.cpp

// Program to find minimum number of platforms
// required on a railway station
#include <bits/stdc++.h>
using namespace std;


 // } Driver Code Ends


int findPlatform(int arr[], int dep[], int n)
{
	sort(arr, arr+n);
	sort(dep, dep+n);
	
	int i = 0, j = 0,  result = 0, pt = 0;
	while(i < n && j < n)
	{
	    if(arr[i] <= dep[j])
	    {
	        pt++;
	        i++;
	    } 
	    else
	    {
	        pt--;
	        j++;
	    }
	    result = max(result, pt);
	}

	return result;
}


// { Driver Code Starts.
// Driver code
int main()
{
    int t;
    cin>>t;
    while(t--) 
    {
        int n;
        cin>>n;
        int arr[n];
        int dep[n];
           for(int i=0;i<n;i++)
        cin>>arr[i];
        for(int j=0;j<n;j++){
            cin>>dep[j];
        }
    cout <<findPlatform(arr, dep, n)<<endl;
    } 
   return 0;
}  // } Driver Code Ends