Given an array arr containing positive elements and an integer K. You have to perform K operations on the string. In one operation you can pick an element of the array (suppose arr[i] ) then divide it into two parts p1,p2 such that p1+p2=arr[i], Now you will delete arr[i] from the array and insert p1 and p2. You need to find the minimum possible value of the maximum element after performing the operation K times.
plz post any similar question on leetcode