forked from thisisshub/HacktoberFest
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcount.cpp
More file actions
49 lines (46 loc) · 915 Bytes
/
Copy pathcount.cpp
File metadata and controls
49 lines (46 loc) · 915 Bytes
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
#include<iostream>
using namespace std;
#include <algorithm>
int platformsNeeded(int arrival[], int departure[], int n) {
/*
* Don't write main().
* Don't read input, it is passed as function argument.
* Don't print anything just return integer value.
*/
int platform=1, result=1;
int i=1, j=0;
sort(arrival, arrival+n);
sort(departure, departure+n);
while (i<n && j<n)
{
if (arrival[i]<=departure[j])
{
platform++;
i++;
if (platform>result)
result=platform;
}
else
{
platform--;
j++;
}
}
return result;
}
int main()
{
int n;
cin>>n;
int* arr=new int[n];
int* dep=new int[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
for(int i=0;i<n;i++)
{
cin>>dep[i];
}
cout<< platformsNeeded(arr, dep, n);
}