Submission #1453264

---

Source Code Expand

#include<functional>
#include<algorithm>
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
#define pb push_back
#define int long long
using namespace std;
const int INF=1000000007;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};


signed main(){
  int n;
  cin>>n;
  int a[n];
  rep(i,n)cin>>a[i];
  sort(a,a+n);
  int ans=INF;
  for(int i=a[0];i<=a[n-1];i++){
    int temp=0;
    for(int j=0;j<n;j++){
      temp+=pow((a[j]-i),2);
    }
    if(temp<ans)ans=temp;
  }
  cout<<ans<<endl;

  return 0;
}

Submission Info

Judge Result