Minimizing sum of A[i]^B[i]

[codeguptaji]

Given two arrays A and B of same size. We can shuffle array A and then we have to minimize the sum of A[i]^B[i] for all i(1,N). Return the minimum sum .
How to solve this problem??

[thor1234]

Looks eerily similar to a problem from an ongoing contest.

[codeguptaji]

yeah but contest has been ended

[anon70990627]

Asked a similar thing earlier

Approach for this question

This question was asked in Scalar Discovery challenge which is over now. The question is- Given two arrays A and B of size N. We are allowed to shuffle the array A, such that the sum of “A[i] xor B[i]” is minimized. Output the minimised sum. Example- 3 1 0 3 5 3 4 Ans- 8 Constraints- 1<=N<=16 0<=A[i],B[i]<=10^8 What should be the approach for this?

[codeguptaji]

Thanx again @anon70990627

[anon70990627]

Wecome @codeguptaji

[ajaymalik]

Approach for this question

dp with mask will be enough to solve this problem 16 * pow(2, 16) look at this problem, same problem i guess two successful submission