Merge K sorted array

思路：

Solution 1 :

Similar to Graph traverse

Initial state, expand and generate rule and termination condition, (need de-duplicate)

Best First search ( priority queue)

Solution 2 :

similar to merge sort, binary merge 2 sorted

solution 3 : merger sort two by two, until only one last