Given an array and k operations where each operation increases any single element by 1, maximize the minimum element of the array after applying at most k operations. Return that maximum possible minimum value. Input: '[arr], k'.
Input: '[arr], k'.
Output: Integer — the maximized minimum value.
Input: [1,2,3,4], 3
Output: 3
Explanation: Raise the small elements; min becomes 3.Input: [5,5,5], 0
Output: 5
Explanation: No operations; min stays 5.Input: [1], 10
Output: 11
Explanation: Single element raised by 10.1<=n<=10^50<=value<=10^90<=k<=10^12