[math-fun] Inequality puzzle

Given fixed real numbers c_1 < c_2 < . . . < c_n, define f(sigma) = Sum_{1 <= j <= n} c_j c_sigma(j) for any permutation sigma of {1,...,n}. Prove that sigma = id_{1,...n} is the unique permutation that maximizes f(sigma). --Dan