Divide a bar into k+1 pieces to maximize the smallest piece

An array of positive integers describes consecutive chunks of a bar. Make exactly k cuts so the bar becomes k + 1 contiguous pieces, and you keep the piece with the smallest sum. Return the largest smallest-piece sum you can get.