Any idea why this solution might have failed CARSELL from April LONG

include<bits/stdc++.h>

using namespace std;

int main()
{int t,n;
cin>>t;
while(t–)
{
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
int sum=0;
for(int i=0;i<n;i++)
{
if (a[i]-n+i<0)
a[i]=0;
else
a[i]+=-n+i+1;
}
for(int i=0;i<n;i++)
sum+=a[i];
cout<<sum%1000000007<<endl;
}
return 0;
}

sum should be long data type.

use mod after every addition operation. i.e : sum+=(a[i]%MOD);