(Rearrangement Theorem) Let $a_1, a_2, \cdots, a_n$ and $b_1, b_2, \cdots, b_n$ be sequences of positive real numbers, and let $c_1, c_2, \cdots, c_n$ be a permutation of $b_1, b_2, \cdots, b_n$. The sum $S=a_1b_1+a_2b_2+\cdots+a_nb_n$ is maximal if the two sequences $a_1, a_2, \cdots, a_n$ and $b_1, b_2, \cdots, b_n$ are sorted in the same way and minimal if the two sequences are sorted oppositely, one increasing and the other decreasing.