make a min heap of first k elements and check if the next coming numbers and update heap accordingly. al last root of heap will give result. O(nlogk-k(k-1)/2)
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
