Global Round 8 problem D reminds me of another problem, Global round 6 problem D as both are solved by constructive algorithms based on the technique of conservation of the total number of 1 bits and total balance respectively, followed by greedy distribution of the values to get the answer.
If anyone has seen more similar problems, kindly leave links in the comments. Thanks.







