-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathMinimumPlatformRequired.cpp
More file actions
107 lines (102 loc) · 1.65 KB
/
Copy pathMinimumPlatformRequired.cpp
File metadata and controls
107 lines (102 loc) · 1.65 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
void merge(int a[], int lb, int mid, int ub)
{
int i=lb;
int j=mid+1;
int k=lb;
//int len=a.size();
int b[ub-lb];
while(i<=mid && j<=ub)
{
if(a[i]<=a[j])
{
b[k]=a[i];
i++;
}
else
{
b[k]=a[j];
j++;
}
k++;
}
if(i>mid)
{
while(j<=ub)
{
b[k]=a[j];
j++;
k++;
}
}
else
{
while(i<=mid)
{
b[k]=a[i];
i++;
k++;
}
}
for(int s=lb; s<=ub; s++)
{
a[s]=b[s];
}
}
void mergesort(int a[], int lb, int ub)
{
if(lb<ub)
{
int mid=(ub+lb)/2;
mergesort(a,lb,mid);
mergesort(a,mid+1,ub);
merge(a,lb,mid,ub);
}
}
int findPlatform(int arr[], int dep[], int n)
{
mergesort(dep,0,n-1);
mergesort(arr,0,n-1);
int mxplt=1,plt=1;
int j=0;
int i=1;
while(i<n && j<n)
{
if(arr[i]<dep[j])
{
plt++;
i++;
if(plt>mxplt)
mxplt=plt;
}
else
{
plt--;
j++;
}
}
return mxplt;
}
// { 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