For yesterday’s contest :
greedy uber driver problem:
What I have thought is modified dijkstra finding shortest path with maximum (minimum of all weights on path).
But it shows WA.
Is my approach correct? If it is, then what might be causing WA?
Any helpful counter test-cases which break my code?