Create merge-k-sorted-lists.cpp

First try:
Selection sort, time complexity = O(k * n), k is the number of lists, n is the total number of nodes in all lists.

Second try:
Leveraging stl's priority queue, which is implemented in head. Time complexity is O(k * logn).