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: #include<bits/stdc++.h>
using namespace std;
 
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define int long long
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using T = pair<int, int>;
typedef long double ld;
 
const int mod = 1e9 + 7;
const int INF = 1e18;
 
void solve(){
    int n;
    cin >> n;
    vector<int> a(2*n);
    for(auto &i : a) cin >> i;
    sort(rall(a));
    int sum = 0;
    for(int i = 0; i < n; i++) sum += a[i];
    for(int i = n; i < 2*n; i++){
        sum -= a[i];
    }
    cout << sum;
}
 
signed main(){
    fast
    int t = 1;
    // cin >> t;
    for(int i = 1; i <= t; i++){
        solve();
        if(i != t) cout << endl;
    }
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?