#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
int main(){
int n;
cin>>n;
ll num[500]={
};
for(int i=0;i<n;i++)cin>>num[i];
sort(num,num+n);//xiao
ll ans=0,h=0,g=0,g1=n-1;
for(int i=0;i<n;i++){
if(i%2==0){
ans+=(num[g1]-h)*(num[g1]-h);
h=num[g1--];
}
else {
ans+=(num[g]-h)*(num[g]-h);
h=num[g++];
}
}cout<<ans;
return 0;
}
luogu P4995 跳跳!
猜你喜欢
转载自blog.csdn.net/Minelois/article/details/113956791
今日推荐
周排行