I would be very grateful if someone can help me out here:
Given two arrays `A` and `B` of equal length, the advantage of `A` with respect to `B` is the number of indices `i` for which `A[i] > B[i]`. Return any permutation of `A` that maximizes its advantage with respect to `B`. Length of `A` can be upto `10000` Input: `A = [12,24,8,32], B = [13,25,32,11]` Output: `[24,32,8,12]`
I want to learn how to do problems like this so I am trying to go step-by-step with the Greedy method.
1Q) Find the greedy strategy
1A) I am struggling very deeply here, I am unable to find a greedy strategy that might work. Can anyone give some idea and motivation here?