Given an array of positive integers, you can perform at most K operations. In each operation, replace an element a[i] with ceil(a[i]/2). Find the minimum possible sum of the array after these…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.