Find the point where maximum intervals overlap
Problem
Consider a big party where a log register for guest’s entry and exit times is maintained. Find the time at which there are maximum guests in the party. Note that entries in register are not in any order.
INPUT: First line No of Intervals. Then Entry array and exit array
Output: only one integer . max overlap time
Time Limit: 5
Memory Limit: 256
Source Limit:
Explanation
Input: arrl[] = {1, 2, 9, 5, 5} exit[] = {4, 5, 12, 9, 12} First guest in array arrives at 1 and leaves at 4, second guest arrives at 2 and leaves at 5, and so on.
Output: 5 There are maximum 3 guests at time 5.
