kMerge implementation using min heap

The implementation of kMerge class uses a MIN HEAP to maintain (compare) the top
 elements of each array. Every iteration we remove the min element from
 the min heap and add the element from the corresponding array (if present).
 Runtime: O(N.klogk)
 Space (apart from resultant array): O(k)