IXL Learning interview question

K largest elements, topological sort, greedy algorithm