Align

AtCoder

IDtenka1_2018_c

Time2000ms

Memory256MB

Difficulty—

You are given $N$ integers; the $i$\-th of them is $A_i$. Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like. ## Constraints * $2 \leq N \leq 10^5$ * $1 \leq A_i \leq 10^9$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $:$ $A_N$ [samples]

Samples

Input #1

Output #1

21

When the integers are arranged as $3,8,1,6,2$, the sum of the absolute differences between the adjacent elements is $|3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21$. This is the maximum possible sum.

Input #2

Output #2

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "Align",
    "description": {
      "content": "You are given $N$ integers; the $i$\\-th of them is $A_i$. Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order y",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "tenka1_2018_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given $N$ integers; the $i$\\-th of them is $A_i$. Find the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order y...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments