Function to find minimum possible sum of pair which breaks the array into 3 non - empty subarrays
int minSumPair ( int arr [ ] , int N ) { if ( N < 5 ) { return -1 ; } int prefixMin [ N ] ; prefixMin [ 0 ] = arr [ 0 ] ;