TREES C++

#include <bits/stdc++.h>
using namespace std;

int a[1000000];
int i,n,mi,res;

void nhap()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];
}

void tim_min()
{
    mi=a[1];
    for(i=2;i<=n;i++)
        if (a[i]<mi)
            mi=a[i];
}
void tinh()
{
    res=0;
    for (i=1;i<=n;i++)
        res=res+(a[i]-mi);
    cout<<res;
}
int main()
{
    freopen("trees.inp","r",stdin);
    freopen("trees.out","w",stdout);
    nhap();
    tim_min();
    tinh();
}