Maximum subarray sum - O(n^2) approach

Is this code correct?
Code:

int main(){
int t;
cin>>t;
while(t–){
int sum = 0;
int g_sum = 0;
int n;
cin>>n;
int a[100000];
for(int i=0; i<n; i++){
cin>>a[i];
}
for(int i=0; i<n-1; i++){
sum = 0;
for(int j = i; j<n; j++){
sum += a[j];
if(sum > g_sum){
g_sum = sum;
}
}
}
cout<<g_sum<<endl;
}

return 0;

}

Yes code is correct
but not optimized

if you submit this
you will get TLE(Time Limit Exceeded)

use kadane’s algorithm to solve it