RU-ALLRUSSIAN 1977 Problem 6
There are direct routes between every two cities in a country. The fare between each pair of cities is the same in both directions. Two travellers decide to visit all the cities. The first traveller starts at a city and travels to the city with the most expensive fare (or if there are several such, any one of them). He then repeats this process, never visiting a city twice, until he has been to all the cities (so he ends up in a different city from the one he starts from). The second traveller has a similar plan, except that he always chooses the cheapest fare, and does not necessarily start at the same city. Show that the first traveller spends at least as much on fares as the second.
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.