Top K Sort algorithm implementation: cnt = 0 tmp[K] = {} //desending array for each pair(key, pld) in if(cnt < K) insert_sort(tmp[], pair) else if(pair.key > tmp[k].key) insert_sort(tmp[], pair)