如题

#include<bits/stdc++.h>
using namespace std;
int a[1005];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	sort(a+1,a+1+n);
	int mih = a[1];
	int mah = a[n];
	int ans = 0;
	int change = (a[n]-a[1]) - 17;
	if(change<=0){
		cout<<0;
		return 0;
	}
	int mih2 = a[2];
	int mah2 = a[n-1];
	int clow = a[2] - a[1];
	int chigh = a[n]-a[n-1];
	ans = pow(clow,2);
	change = change - clow;
	ans = ans+pow(change,2);
	cout<<ans;
	return 0;
}