Submission #2114752

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include<queue>
#include<set>
#include <climits>
using namespace std;

int main()
{
  int n, sum = 0, tmp = 0, result = INT_MAX;
  cin >> n;
  vector<int> a(n, 0);

  for (int i = 0; i < n; i++)
  {
    cin >> a[i];
    sum += a[i];
  }

  sort(a.begin(), a.end());
  int a_max = a.back();

  for (int i = 1; i < n; i++)
  {
    if(a[i -1] == a[i])
      tmp++;
  }

  if(tmp == n - 1)
  {
    cout << 0 << endl;
    exit(0);
  }

  for (int i = -100; i <= 100; i++)
  {
    tmp = 0;
    for (int j = 0; j < n; j++)
    {
      tmp += (i - a[j]) * (i - a[j]);
    }
    if(result > tmp) result = tmp;
  }
  cout << result << endl;
}

Submission Info

Judge Result