Given two arrays as:\nAn array A of size N\nAn array B of size M\n\nA sequence S is called a Hybrid sequence if it has length N + M and it can be divided into exactly 2 disjoint subsequences A and B.\n\nAmong all the possible hybrid sequences S, determine the maximum value of the expression.\n\n[Sum of max(S1) max(S2),....max(SN+M)] - [Sum of min(S1),min(S2),.. min(SN+M)]\n\nAssume indexing is 1 based\n\nInput:\nN = 2\nA = [4,3]\nM = 2\nB = [1,2]\n\nOutput:\n9\n\nThe hybrid sequence S = [4,1,2,3] gives the maximum value\n\nExplanation:\n\n[4,1,2,3] -> [max(4)+max(4,1)+max(4,1,2)+max(4,1,2,3)]-[min(4)+min(4,1)+min(4,1,2)+min(4,1,2,3)] = 16-7 = 9\n\nI supposed that max(S)*(l-1)-min(S)*(l-1), where S= A+B and l is the total number of elements in S,  will be the solution, but it failed most of test cases. Can someone explain the problem and maybe solution itself.

Given two arrays as:\nAn array A of size N\nAn array B of size M\n\nA sequence S is called a Hybrid sequence if it has length N + M and it can be divided into e