Equal Candies Codeforces Solution | Codeforces Problem Solution 2022

Equal Candies Codeforces Solution | Codeforces Problem Solution 2022

B. Equal Candies

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are 𝑛$n$ boxes with different quantities of candies in each of them. The 𝑖$i$-th box has 𝑎𝑖$a_i$ candies inside.

You also have 𝑛$n$ friends that you want to give the candies to, so you decided to give each friend a box of candies. But, you don't want any friends to get upset so you decided to eat some (possibly none) candies from each box so that all boxes have the same quantity of candies in them. Note that you may eat a different number of candies from different boxes and you cannot add candies to any of the boxes.

Solution Click Below:-  CLICK HERE

What's the minimum total number of candies you have to eat to satisfy the requirements?

Input

The first line contains an integer 𝑡$t$ (1≤𝑡≤1000$1\le t\le 1000$) — the number of test cases.

Lucky? Codeforces Solution

Equal Candies Codeforces Solution

Most Similar Words Codeforces Solution

X-Sum Codeforces Solution

Eating Queries Codeforces Solution

Longest Strike Codeforces Solution

White-Black Balanced Subtrees Codeforces Solution

Maximum Crossings (Easy Version) Codeforces Solution

Maximum Crossings (Hard Version) Codeforces Solution

The first line of each test case contains an integer 𝑛$n$ (1≤𝑛≤50$1\le n\le 50$) — the number of boxes you have.

The second line of each test case contains 𝑛$n$ integers 𝑎1,𝑎2,…,𝑎𝑛$a_1,a_2,\dots ,a_n$ (1≤𝑎𝑖≤107$1\le a_i\le {10}^7$) — the quantity of candies in each box.

Output

For each test case, print a single integer denoting the minimum number of candies you have to eat to satisfy the requirements.

Join Now for Solution:-