Account
GitHubFeedback
Drafts and results saved on this device
Submit on CSES.fi
CSES Problemset/Sorting and Searching

Stick Lengths

#1074
Ask AI

Open a hint-first prompt in a new AI chat. Grok may ask you to confirm before sending.

Open Claude Desktop

Time limit:1.00 s
Memory limit:512 MB
Unsolved
Download Tests (.zip)

There are nn sticks with some lengths. Your task is to modify the sticks so that each stick has the same length.

You can either lengthen and shorten each stick. Both operations cost xx where xx is the difference between the new and original length.

What is the minimum total cost?

Input

The first input line contains an integer nn: the number of sticks.

Then there are nn integers: p1,p2,…,pnp_1,p_2,\ldots,p_n: the lengths of the sticks.

Output

Print one integer: the minimum total cost.

Constraints
  • 1≤n≤2⋅1051 \le n \le 2 \cdot 10^5
  • 1≤pi≤1091 \le p_i \le 10^9
Sample Test Cases (1)
Example 1ID: sample-1
Input
5
2 3 1 5 2
Expected Output
5
Tools
1
2
3
4
5
6
7
8
9
10
11
12
Draft saved locally
|1 line, 0 chars
Test Bench
Download .zip
Input (stdin)
5
2 3 1 5 2
Expected Output
5