How to solve the tricky puzzle about floors?

Question

Mathematics

A chess tournament is held in a high-rise hotel. Several guests from different floors want to take part in it. There can be more than one person on the same floor.
Unfortunately, the elevator in the hotel does not work, so you need to choose the floor for the tournament, so that the sum of floors passed by all participants to the place of organization is minimal.
Something like an optimization problem. What are some ideas for a solution?

Answer 1

Find the floor - the "median floor" and put everyone on it (these are floors such that the difference between those living above and those living below is minimal).
Go down or up a few floors (so many that among them were the "native" floors of the guests).
Compare the total number of flights travelled.