A. Holiday Of Equality

Codeforces

IDCF758A

Time1000ms

Memory256MB

Difficulty—

implementationmath

English · Original

Chinese · Translation

Formal · Original

In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury. Totally in Berland there are _n_ citizens, the welfare of each of them is estimated as the integer in _a__i_ burles (burle is the currency in Berland). You are the royal treasurer, which needs to count the minimum charges of the kingdom on the king's present. The king can only give money, he hasn't a power to take away them. ## Input The first line contains the integer _n_ (1 ≤ _n_ ≤ 100) — the number of citizens in the kingdom. The second line contains _n_ integers _a_1, _a_2, ..., _a__n_, where _a__i_ (0 ≤ _a__i_ ≤ 106) — the welfare of the _i_\-th citizen. ## Output In the only line print the integer _S_ — the minimum number of burles which are had to spend. [samples] ## Note In the first example if we add to the first citizen 4 burles, to the second 3, to the third 2 and to the fourth 1, then the welfare of all citizens will equal 4. In the second example it is enough to give one burle to the third citizen. In the third example it is necessary to give two burles to the first and the third citizens to make the welfare of citizens equal 3. In the fourth example it is possible to give nothing to everyone because all citizens have 12 burles.

在伯兰，今天是平等节。为了庆祝这个节日，国王决定通过国家金库的支出，使所有公民的福利均等化。伯兰共有 #cf_span[n] 名公民，每个人的福利被评估为一个整数 #cf_span[ai] 布尔（布尔是伯兰的货币）。你是皇家财政官，需要计算国王赠礼所需的最少开支。国王只能给钱，没有权力收回钱。第一行包含整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 100]）——王国中公民的数量。第二行包含 #cf_span[n] 个整数 #cf_span[a1, a2, ..., an]，其中 #cf_span[ai]（#cf_span[0 ≤ ai ≤ 106]）——第 #cf_span[i] 位公民的福利。仅在一行中输出整数 #cf_span[S]——需要花费的最少布尔数。在第一个例子中，如果我们给第一位公民增加 #cf_span[4] 布尔，第二位增加 #cf_span[3]，第三位增加 #cf_span[2]，第四位增加 #cf_span[1]，则所有公民的福利都将等于 #cf_span[4]。在第二个例子中，只需给第三位公民一布尔即可。在第三个例子中，必须给第一位和第三位公民各两布尔，使所有公民的福利等于 #cf_span[3]。在第四个例子中，无需给任何人任何钱，因为所有公民都有 #cf_span[12] 布尔。 ## Input 第一行包含整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 100]）——王国中公民的数量。第二行包含 #cf_span[n] 个整数 #cf_span[a1, a2, ..., an]，其中 #cf_span[ai]（#cf_span[0 ≤ ai ≤ 106]）——第 #cf_span[i] 位公民的福利。 ## Output 仅在一行中输出整数 #cf_span[S]——需要花费的最少布尔数。 [samples] ## Note 在第一个例子中，如果我们给第一位公民增加 #cf_span[4] 布尔，第二位增加 #cf_span[3]，第三位增加 #cf_span[2]，第四位增加 #cf_span[1]，则所有公民的福利都将等于 #cf_span[4]。在第二个例子中，只需给第三位公民一布尔即可。在第三个例子中，必须给第一位和第三位公民各两布尔，使所有公民的福利等于 #cf_span[3]。在第四个例子中，无需给任何人任何钱，因为所有公民都有 #cf_span[12] 布尔。

**Definitions** Let $ n \in \mathbb{Z} $ be the number of citizens. Let $ A = (a_1, a_2, \dots, a_n) $ be a sequence of non-negative integers representing the welfare of each citizen. **Constraints** 1. $ 1 \leq n \leq 100 $ 2. $ 0 \leq a_i \leq 10^6 $ for all $ i \in \{1, \dots, n\} $ **Objective** Find the minimum total amount of money to distribute (only additions allowed) so that all citizens have equal welfare. This minimum is: $$ S = n \cdot \max(A) - \sum_{i=1}^{n} a_i $$

Samples

Input #1

5
0 1 2 3 4

Output #1

Input #2

5
1 1 0 1 1

Output #2

Input #3

3
1 3 1

Output #3

Input #4

1
12

Output #4

API Response (JSON)

{
  "problem": {
    "name": "A. Holiday Of Equality",
    "description": {
      "content": "In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury. Totally in Berland there ar",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF758A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "In Berland it is the holiday of equality. In honor of the holiday the king decided to equalize the welfare of all citizens in Berland by the expense of the state treasury.\n\nTotally in Berland there ar...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "在伯兰，今天是平等节。为了庆祝这个节日，国王决定通过国家金库的支出，使所有公民的福利均等化。\n\n伯兰共有 #cf_span[n] 名公民，每个人的福利被评估为一个整数 #cf_span[ai] 布尔（布尔是伯兰的货币）。\n\n你是皇家财政官，需要计算国王赠礼所需的最少开支。国王只能给钱，没有权力收回钱。\n\n第一行包含整数 #cf_span[n]（#cf_span[1 ≤ n ≤ 100]）——王国中...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the number of citizens.  \nLet $ A = (a_1, a_2, \\dots, a_n) $ be a sequence of non-negative integers representing the welfare of each citizen.\n\n**Constrain...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}

Full JSON Raw Segments