IXL Learning Interview Question

K largest elements, topological sort, greedy algorithm