I am getting TLE

#include 
using namespace std;
 
int main(){
	int n1,n2,n3;
	//cin>>n1>>n2>>n3;
	scanf("%d%d%d",&n1,&n2,&n3);
	int arr1[n1],arr2[n2],arr3[n3];
	for(int i=0;i
		scanf("%d",&arr1[i]);
	}
	for(int i=0;i
		scanf("%d",&arr2[i]);
	}
	for(int i=0;i
		scanf("%d",&arr3[i]);
	}
	int m=max(n1,max(n2,n3))+1;
	int result[m];
	int mini,count,j=0,k=0,l=0,v=0,a,b,c;
	while(j
		count=0;
		if(j
		else a=1600001;
		if(k
		else b=260002;
		if(l
		else c=3060003;
		mini=min(a,min(b,c));
		if(mini==a){
				j++;
			count++;
		}
		if(mini==b){
				k++;
			count++;
		}		
		if(mini==c){	
				l++;
			count++;
		}
		if(count>=2){
			result[v]=mini;
			v++;			
		}
	}
	printf("%d\n",v);
	for(int i=0;i
		printf("%d\n",result[i]);
	}
}

I did that but i am getting segmentation fault in 4 test cases

Can you give a hint how can I calculate the jth index for the maximum(forward + backward) ?

I am counting at first forward from the k+1th position till i get maximum . Now from that index till the first one but i missed some test cases . Is something wrong in my approach?