Codeforces--1106C--Lunar New Year and Number Division

题目描述：
Lunar New Year is approaching, and Bob is struggling with his homework – a number division problem.

There are n positive integers a1,a2,…,an on Bob’s homework paper, where n is always an even number. Bob is asked to divide those numbers into groups, where each group must contain at least 2 numbers. Suppose the numbers are divided into m groups, and the sum of the numbers in the j-th group is sj. Bob’s aim is to minimize the sum of the square of sj, that is
∑j=1ms2j.
Bob is puzzled by this hard problem. Could you please help him solve it?
输入描述:
The first line contains an even integer n (2≤n≤3⋅105), denoting that there are n integers on Bob’s homework paper.

The second line contains n integers a1,a2,…,an (1≤ai≤104), describing the numbers you need to deal with.
输出描述:
A single line containing one integer, denoting the minimum of the sum of the square of sj, which is
∑i=jms2j,
where m is the number of groups.
输入：
4
8 5 2 3
6
1 1 1 2 2 2
输出：
164
27
题意：
给定一个n个数的序列(n为偶数) 。将数列组合为若干组。每组的数的个数至少为2。求每一组数的和平方后，所有组之和的最小值。
题解：
第i小与第i大两两配对就行了。
代码：