ExaWizards | Software Developer | 5 December

Given a list of airline tickets, each with a departure city, destination city, and price, find the minimum cost of traveling from a city to another, using at most K tickets. Your algorithm must be efficient. The input is given via standard input. The 1st line is the departure city. The 2nd line is the destination city. The 3rd line is the maximum number of tickets used for the flight, K. The 4th line is the number of airline tickets ...