Everything is pretty simple here. What should be done here is to give the laziest student the easiest task, because it is always optimal to do so. If we do that continuously, it becomes obvious that the solution is to sort the given array and use the following formula:

$$\displaystyle \sum_{i=1}^N A[i] \times A[N-i-1]$$