Given n cities and distances of each city from a starting city, say K. A traveler has to travel these cities in increasing order of distance and in a lexicographically increasing order of city names. Find max number of cities he can travel with the given constraints \n\ncities: Chennai, Bangalore, Visakhapatnam,  Hyderabad,  Mumbai\ndistances: 380, 200, 250, 750, 635\n\nAns: 3\n\nPossibilities: \nBangalore -> Chennai -> Mumbai\n\nBangalore -> Chennai -> Hyderabad\n\nCan anyone provide solution?

Given n cities and distances of each city from a starting city, say K. A traveler has to travel these cities in increasing order of distance and in a lexicograp