Question : Merge two sorted array without extra space;
i used second array B as a min heap. For each element in A (size n) , i compared it with
B, if i A[i] is greater than B each time ,then i swapped it. and maintained my min heap B (size m) ( using make_heap in log m);
so my complexity should be n*logm and with given constraints ( n,m < 5x10^4) my code should calculate in < 1sec ??