0
Problem. There are $n$ numbered cells. Each of the $k$ objects ($n<k$) is assigned a priority $p=1, 2, …, n$, with which the object is placed in the $i$-th cell. It is required to put uniformly all objects across all cells, taking into account the priority of at least $b$.
Here, by "put uniformly"...