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 at the party. Note that entries in the register are not in any order. if two events have the same time, then arrival is preferred over the exit.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the size of the entry and exit array. Then the next two lines contains the entry and exit array respectively.
Print the maximum no of guests and the time at which there are maximum guests at the party.
1 2 10 5 5
4 5 12 9 12
13 28 29 14 40 17 3
107 95 111 105 70 127 74
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes