View Code of Problem 4065

#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int main(){
	int n;
	int ar[110];
	while(cin>>n){
		int t=0;
		for(int i=0;i<n;i++){
			cin>>ar[i];
		}
		sort(ar,ar+n);
		int ma_x=n-1,mi_n=0;
		long long sum=pow(ar[ma_x],2);
		t++;
		while(t<n){
			sum+=pow(ar[ma_x]-ar[mi_n],2);
			ma_x--;
			t++;
			if(t<n){
			sum+=pow(ar[mi_n]-ar[ma_x],2);
			mi_n++;
			t++;
			}
		}
		cout<<sum<<endl; 
	}
}