Loop to find the minimum prizes required
for ( int i = 0 ; i < n ; i ++ ) { totalPrizes += Math . Max ( dpLeft [ i ] , dpRight [ i ] ) ; } Console . Write ( totalPrizes + " STRNEWLINE " ) ; return 0 ; }