Let $n_1,n_2,\ldots,n_t$ be positive integers. Show that if $n_1+n_2+\cdots+n_t-t+1$ objects are placed into $t$ boxes, then for some $i$, $i = 1,2,\ldots,t$, the $i$th box contatins at least $n_i$ objects.
I don't understand what "$i$th box contains at least $n_i$ objects" means. I've tried doing a specific example to see what is going on and this is what I came up with.
$n_1$ = 12 , $n_2$ = 8, $n_3$ = 34, $n_4$ = 11
$t$ =4
The sum of my $n_1,n_2\ldots,n_t$ elements is 65 then I subtract 4 and add 1 to get 62 objects. I then cacluclate $\left\lceil\frac{62}{4}\right\rceil$ = 16. So, does that mean that at $i$ = 3 my $n_3$ box contains at least 16 objects because it contains 32 objects?
Any hints on constructing the proof itself is also appreciated.