codeforces 872 B. Maximum of Maximums of Minimums

https://www.elijahqi.win/archives/1255
You are given an array a1, a2, …, an consisting of n integers, and an integer k. You have to split the array into exactly k non-empty subsegments. You’ll then compute the minimum integer on each subsegment, and take the maximum integer over the k obtained minimums. What is the maximum possible integer you can get? You