题目链接:https://ac.nowcoder.com/acm/contest/317/B
思路:排序后前后取即可。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int x[100005], a, b, n;
int main()
{
ll ans = 0;
scanf("%d",&n);
for(int i = 1; i <= n; i++)
scanf("%d",&x[i]);
sort(x+1,x+n+1);
for(int i = 0; i <= n/2; i++)
ans += (x[n-i]-x[i])*(x[n-i]-x[i])+(x[i+1]-x[n-i])*(x[i+1]-x[n-i]);
printf("%lld", ans);
return 0;
}