Maximize Bitwise AND with a Limited Increment Budget

Given an array arr of n non-negative integers, an integer K, and a budget C, you may increase any array elements by non-negative amounts as long as the total amount added is at most C.

Afte...