View Code of Problem 4065

#include<iostream>
#include<string>
#include<algorithm>
#include<stack>
#include<vector>
#include<cmath>

using namespace std;

//最远距离及max-min，以此循环直至走过所有点

int main() {
	int n;
	while (cin >> n && n != 0)
	{
		int *arr = new int[n];
		for (int i = 0; i < n; i++)
			cin >> arr[i];
		sort(arr, arr + n);
		int sum = pow(arr[n - 1], 2);
		for (int i = 0, j = n - 2; i <= j; i++, j--)
		{
			sum += pow((arr[j + 1] - arr[i]), 2);
			sum += pow((arr[j] - arr[i]), 2);
		}
		cout << sum << endl;
	}
	return 0;
}