Create Merge K sorted List

Use a heap to load the smallest node; Suppose n nodes in total, k lists, the time complexity is logk * n