Help me in solving PLPROCESS problem

help
,
1

My issue

I am unable to figure out which test cases are failing.

My code

#include <iostream>
using namespace std;

int main() {
	int t;
	cin>>t;
	while(t--)
	{
	    int n;
	    long long int max_t, min_t = 1e5+10;
	    cin>>n;
	    long long int a[n+10], prefixSum[n+10];
	    prefixSum[0] = 0;
	    for (int i = 1; i <=n; i++)
	    {
	        cin>>a[i];
	        prefixSum[i] = prefixSum[i-1] + a[i];
	    }
	    for (int i = 1; i <= n; i++)
	    {
	        max_t = max(prefixSum[i], prefixSum[n] - prefixSum[i]);
	        min_t = min(min_t, max_t);
	    }
	    cout<<min_t<<endl;
	}
}

Problem Link: PLPROCESS Problem - CodeChef