Cheapest Flights Within K Stops

This problem is part of solulu Pro

There are n cities and flights [from, to, price]. Return the cheapest price from src to dst using at most k stops (so at most k + 1 flights), or -1 if there's no such route.