Codeforces Round #790 (Div. 4) 1676B. Equal Candies Solution

 Problem Link: https://codeforces.com/contest/1676/problem/b

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int  n,x,y,t,r,i,mx;

    cin>>t;

    while(t--)

    {

      cin>>n;

      int a[n+9];

      r=0;

      for(i=0;i<n;i++)

        cin>>a[i];

 

        sort(a,a+n);

        int mn=a[0];

        for(i=0;i<n;i++)

        {

            r+=(a[i]-mn);

        }

        cout<<r<<endl;

 

    }

}