Minimize Peak Mobile Memory

Given an integer array usage and an integer k, each operation chooses one element and replaces it with floor(value / 2). Return the minimum possible value of the maximum element after at most k operations.

Inputusage = [10, 20, 7], k = 4Output5WhyReduce 20 twice, 10 once, and 7 once.

Inputusage = [1, 8, 8], k = 2Output4WhyReduce each 8 once.

Problem

Examples

Example 1

Inputusage = [10, 20, 7], k = 4Output5WhyReduce 20 twice, 10 once, and 7 once.

Example 2

Inputusage = [1, 8, 8], k = 2Output4WhyReduce each 8 once.

Constraints

`1 <= usage.length <= 10^5`
`0 <= usage[i] <= 10^9`
`0 <= k <= 10^9`

Problem

Examples

Example 1

Inputusage = [10, 20, 7], k = 4Output5WhyReduce 20 twice, 10 once, and 7 once.

Example 2

Inputusage = [1, 8, 8], k = 2Output4WhyReduce each 8 once.

Constraints

`1 <= usage.length <= 10^5`
`0 <= usage[i] <= 10^9`
`0 <= k <= 10^9`

Problem

Examples

Example 1

Inputusage = [10, 20, 7], k = 4Output5WhyReduce 20 twice, 10 once, and 7 once.

Example 2

Inputusage = [1, 8, 8], k = 2Output4WhyReduce each 8 once.

Constraints

`1 <= usage.length <= 10^5`
`0 <= usage[i] <= 10^9`
`0 <= k <= 10^9`

Interview Guides

Problem

Examples

Constraints

Problem

Examples

Constraints

Minimize Peak Mobile Memory

Problem

Examples

Constraints

Problem

Examples

Constraints