Challenge: Maximum Advertisement Revenue

Problem

---

This problem is similar to the Maximum Product of Two Sequences Problem.

Maximum Product of Two Sequences

Find the maximum dot product of two sequences of numbers.

Input: Two sequences of $n$ positive integers: $price_{1},\ldots, price_{n}$ and $clicks_{1},\ldots, clicks_{n}$.
Output: The maximum value of $price_{1} · c_{1} +\ldots + price_{n}$ . $c_{n}$, where $c_{1},\ldots, c_{n}$ is a permutation of $clicks_{1},\ldots, clicks_{n}$.

---