//PLEASE WRITE A DRIVEN PROGRAM FOR THE CODE BRLOW

//HERE VALUE FROM PROFESSOR

//Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] Explanation: The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6

//PLEASE SHOW ME THE OUTPUT

//DONOT SEND ME FAKE ANSWER

#include #include #include using namespace std; ///* Definition for singly-linked list. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; class Solution { public: ListNode* mergeKLists(vector& lists) { priority_queue, greater> minHeap; for (auto list : lists) { while (list) { minHeap.push(list->val); list = list->next; } } ListNode* dummy = new ListNode(0); ListNode* curr = dummy; while (!minHeap.empty()) { curr->next = new ListNode(minHeap.top()); minHeap.pop(); curr = curr->next; } return dummy->next; } };

int main() { // TO DO

}