Loop to find the minimum prizes required
for ( int i = 0 ; i < n ; i ++ ) { totalPrizes += Math . max ( dpLeft [ i ] , dpRight [ i ] ) ; } System . out . print ( totalPrizes + "NEW_LINE"); return 0 ; }