https://codeforces.ml/contest/1452/problem/B
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has nn boxes and the ii-th box has aiai blocks. His game consists of two steps:
- he chooses an arbitrary box ii;
- he tries to move all blocks from the ii-th box to other boxes.
If he can make the same number of blocks in each of n−1n−1 other boxes then he will be happy, otherwise, will be sad. Note that your nephew can only move the blocks from the chosen box to the other boxes; he cannot move blocks from the other boxes.
You don't want to make your nephew sad, so you decided to put several extra blocks into some boxes in such a way that no matter which box ii he chooses he won't be sad. What is the minimum number of extra blocks you need to put?
Input
The first line contains a single integer tt (1≤t≤10001≤t≤1000) — the number of test cases.
The first line of each test case contains the integer nn (2≤n≤1052≤n≤105) — the number of boxes.
The second line of each test case contains nn integers a1,a2,…,ana1,a2,…,an (0≤ai≤1090≤ai≤109) — the number of blocks in each box.
It's guaranteed that the sum of nn over test cases doesn't exceed 105105.
Output
For each test case, print a single integer — the minimum number of blocks you need to put. It can be proved that the answer always exists, i. e. the number of blocks is finite.
Example
input
Copy
3 3 3 2 2 4 2 2 3 2 3 0 3 0
output
Copy
1 0 3
Note
In the first test case, you can, for example, put one extra block into the first box and make a=[4,2,2]a=[4,2,2]. If your nephew chooses the box with 44 blocks, then we will move two blocks to the second box and two blocks to the third box. If he chooses the box with 22 blocks then he will move these two blocks to the other box with 22 blocks.
In the second test case, you don't need to put any extra blocks, since no matter which box your nephew chooses, he can always make other boxes equal.
In the third test case, you should put 33 extra blocks. For example, you can put 22 blocks in the first box and 11 block in the third box. You'll get array a=[2,3,1]a=[2,3,1].
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e6+5;
const ll mod=1e9+7;
ll n,t,k,s,x,y;
ll a[maxn];
int main()
{
cin>>t;
while(t--)
{
cin>>n;
s=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
s+=a[i];
}
sort(a+1,a+1+n);
ll l=a[n],r=mod*2;
k=a[n];
while(l<=r)
{
ll mid=(l+r)/2;
if(mid*(n-1)>=s)
{
r=mid-1;
k=mid;
}
else
l=mid+1;
}
ll ans=k*(n-1)-s;
cout<<ans<<endl;
}
return 0;
}