The start time of one chosen meeting can’t be equal to the end time of the other chosen meeting. Also for the same end time, a meeting with a smaller index is preferred.
The first line contains an integer 'T' denoting the number of test cases or queries to be run. The first line of each test case or query contains a single integers 'N' denoting the number of meetings. The second line of each test case contains N single space-separated integers denoting the start time of N meetings respectively. The third line of each test case contains N single space-separated integers denoting the end time of N meetings respectively.
For each test case, print the meeting numbers (Consider 1 based indexing) you organized in the given room, in the order in which you organized them such that the number of meetings is maximum.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 5 1 <= N <= 10^5 0 <= Start[i] < End[i] <= 10^9 Time Limit: 1 sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End