A hotel manager has to process N advance bookings of rooms for the next season. His hotel has C rooms. Bookings contain an arrival date and a departure date. He wants to find out whether there are enough rooms in the hotel to satisfy the demand. Write a program that solves this problem in time O(N log N) .
First argument is an integer array A containing arrival time of booking.
Second argument is an integer array B containing departure time of booking.
Third argument is an integer C denoting the count of rooms.
Return True if there are enough rooms for N bookings else return False.
Return 0/1 for C programs.
A = [1, 3, 5] B = [2, 6, 8] C = 1
A = [1, 2, 3] B = [2, 3, 4] C = 2
At day = 5, there are 2 guests in the hotel. But I have only one room.
At day = 1, there is 1 guest in the hotel.
At day = 2, there are 2 guests in the hotel.
At day = 3, there are 2 guests in the hotel.
At day = 4, there is 1 guest in the hotel.
We have two rooms available, which satisfy the demand.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.