Algorithm for automatic distribution of tasks
System sums up points for all cleanings that need to be carried out and divides them by selected cleaners, so gets the average number of points per cleaner. Further in order, in accordance with the sorting order of the selected rooms, assigns them to cleaners until the sum of points exceeds the average. We randomly determine who will do the last cleaning - this cleaner or the next one. Then we go to the next cleaner, with the change that if the previous one had an shortage, then this one will have an overwork and other way around. The last gets the rest.