> Use an array of size k as a min heap.
> With every element, compare it with min of heap, if found larger, insert in heap, else, ignore.
> Once the heap is full, if found larger than min of heap, delete the min and insert.
N = {8,4,2,6,1,5,6,9,10,3}, let k = 3 K = {}
N = {8,4,2,6,1,5,6,9,10,3} K ={8}
N = {8,4,2,6,1,5,6,9,10,3} K = {4,8}
N = {8,4,2,6,1,5,6,9,10,3} K = {2,4,8}
N = {8,4,2,6,1,5,6,9,10,3} K = {4,6,8}
N = {8,4,2,6,1,5,6,9,10,3} K = {4,6,8}
N = {8,4,2,6,1,5,6,9,10,3} K = {5,6,8}
N = {8,4,2,6,1,5,6,9,10,3} K = {5,6,8}
N = {8,4,2,6,1,5,6,9,10,3} K = {6,8,9}
N = {8,4,2,6,1,5,6,9,10,3} K = {8,9,10}
N = {8,4,2,6,1,5,6,9,10,3} K = {8,9,10}