For this Question: You are given an integer N and two arrays A and B each of size N. In one move, you can swap any integer from array A with that of array B, they don't need to have the same index. Let sum<sub>A</sub> be the sum of elements of array A and sum<sub>B</sub> be the sum of the elements of array B. Find the maximum possible value of <b>sum<sub>A</sub> - sum<sub>B</sub></b> possible after applying optimal moves.First line of the input contains an integer N,
The second line of the input contains N space seperated integers of array A,
The third line of the input contains N space seperated integers of array B.

Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub>, B<sub>i</sub> <= 10<sup>9</sup>Print the maximum possible value of sum<sub>A</sub> - sum<sub>B</sub> possible after apply optimal moves.Sample Input:
5
7 9 4 4 2
8 3 2 4 1

Sample Output:
20

Explaination:
We swap B<sub>1</sub> with A<sub>5</sub>, This makes A = [7, 9, 4, 4, 8], B = [2, 3, 2, 4, 1]. sum<sub>A</sub> = 32.
sum<sub>B</sub> = 12.
sum<sub>A</sub> - sum<sub>B</sub> = 20
It can be proved that this is the maximum possible difference., I have written this Solution Code: N = int(input())
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]

A.sort()
B.sort()
B = B[::-1]
i, j = 0, 0
while i < N and j < N:
    if A[i] < B[j]:
        A[i], B[j] = B[j], A[i]
    i += 1
    j += 1

print(sum(A) - sum(B)), In this Programming Language: Python, Now tell me if this Code is compilable or not?