B"You are given two arrays a and b , consisting of n integers each. Let's define a function f(a, b) as follows: Find the maximum value of the function f(a, b) if you can reorder the array b in an arbitrary way (leaving the initial order is also an option). The first line contains one integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The first line of each test case contains one integer n ( 1 <= n <= 10^5 ) -- the size of arrays a and b . The second line contains n integers a_1, a_2, ... , a_n ( 0 <= a_i < 2^{30} ). The third line contains n integers b_1, b_2, ... , b_n ( 0 <= b_i < 2^{30} ). The sum of n over all test cases does not exceed 10^5 . For each test case print one integer -- the maximum value of the function f(a, b) if you can reorder the array b in an arbitrary way. "...