打印N个数组整体最大的TopK

【题目】有N个长度不一的数组，所有的数组都是有序的，请从大到小打印这N个数组整体最大的前K个数。

【要求】1.如果所有数组的元素个数小于K,则从大到小打印所有的数。

要求时间复杂度为O（KlogN).

public class NTopK {
	public static class HeapNode {
		public int value;
		public int arrNum;
		public int index;

		public HeapNode(int value, int arrNum, int index) {
			this.value = value;
			this.arrNum = arrNum;
			this.index = index;
		}
	}
	public static void main(String[] args) {
		int[][] arr = {{219,405,538,845,971},{148,558},{52,99,348,691}};
		printTopK(arr,5);
	}

	public static void printTopK(int[][] matrix, int topK) {
		int heapSize = matrix.length;
		HeapNode[] heap = new HeapNode[heapSize];
		for (int i = 0; i < heapSize; i++) {
			int index = matrix[i].length - 1;
			heap[i] = new HeapNode(matrix[i][index], i, index);
			heapInsert(heap, i);
		}
		System.out.println("TopK " + topK + " ");
		for (int i = 0; i < topK; i++) {
			if (heapSize == 0) {
				break;
			}
			System.out.print(heap[0].value + " ");
			if (heap[0].index != 0) {
				heap[0].value = matrix[heap[0].arrNum][--heap[0].index];
			} else {
				swap(heap, 0, --heapSize);
			}
			heapify(heap, 0, heapSize);
		}
	}

	public static void heapify(HeapNode[] heap, int index, int heapSize) {
		int left = index * 2 + 1;
		while (left < heapSize) {
			int largest = (left + 1 < heapSize && heap[left].value < heap[left + 1].value) ? left + 1 : left;
			largest = heap[largest].value > heap[index].value ? largest : index;
			if (largest == index) {
				break;
			}
			swap(heap, largest, index);
			index = largest;
			left = index * 2 + 1;
		}
	}

	public static void heapInsert(HeapNode[] heap, int index) {
		while (heap[index].value > heap[(index - 1) / 2].value) {
			swap(heap, index, (index - 1) / 2);
			index = (index - 1) / 2;
		}
	}

	public static void swap(HeapNode[] heap, int a, int b) {
		HeapNode temp = heap[a];
		heap[a] = heap[b];
		heap[b] = temp;
	}
}