AtCoder Regular Contest 059
翻译中…
Problem Statement
翻译中…
Evi has $N$ integers $a_1,a_2,..,a_N$. His objective is to have $N$ equal integers by transforming some of them.
翻译中…
He may transform each integer at most once. Transforming an integer $x$ into another integer $y$ costs him $(x-y)^2$ dollars. Even if $a_i=a_j (i≠j)$, he has to pay the cost separately for transforming each of them (See Sample 2).
翻译中…
Find the minimum total cost to achieve his objective.
翻译中…
Constraints
翻译中…
$1≦N≦100$$-100≦a_i≦100$
翻译中…
Input
翻译中…
The input is given from Standard Input in the following format:
翻译中…
N
a_1 a_2 ... a_N翻译中…
Output
翻译中…
Print the minimum total cost to achieve Evi's objective.
翻译中…
样例
Input #1
2
4 8
Output #1
8
Transforming the both into $6$s will cost $(4-6)^2+(8-6)^2=8$ dollars, which is the minimum.
Input #2
3
1 1 3
Output #2
3
Transforming the all into $2$s will cost $(1-2)^2+(1-2)^2+(3-2)^2=3$ dollars. Note that Evi has to pay $(1-2)^2$ dollar separately for transforming each of the two $1$s.
Input #3
3
4 2 5
Output #3
5
Leaving the $4$ as it is and transforming the $2$ and the $5$ into $4$s will achieve the total cost of $(2-4)^2+(5-4)^2=5$ dollars, which is the minimum.
Input #4
4
-100 -100 -100 -100
Output #4
0
Without transforming anything, Evi's objective is already achieved. Thus, the necessary cost is $0$.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。