Chefina has two sequences $A_1, A_2, \ldots, A_N$ and $B_1, B_2, \ldots, B_N$. She views two sequences with length $N$ as identical if, after they are sorted in non-decreasing order, the $i$-th element of one sequence is equal to the $i$-th element of the other sequence for each $i$ ($1 \le i \le N$).
To impress Chefina, Chef wants to make the sequences identical. He may perform the following operation zero or more times: choose two integers $i$ and $j$ $(1 \le i,j \le N)$ and swap $A_i$ with $B_j$. The cost of each such operation is $\mathrm{min}(A_i, B_j)$.
You have to find the minimum total cost with which Chef can make the two sequences identical.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains a single integer $N$.
- The second line contains $N$ space-separated integers $A_1, A_2, \ldots, A_N$.
- The third line contains $N$ space-separated integers $B_1, B_2, \ldots, B_N$.

-----Output-----
For each test case, print a single line containing one integer ― the minimum cost, or $-1$ if no valid sequence of operations exists.

-----Constraints-----
- $1 \le T \le 2,000$
- $1 \le N \le 2 \cdot 10^5$
- $1 \le A_i, B_i \le 10^9$ for each valid $i$
- the sum of $N$ over all test cases does not exceed $2 \cdot 10^6$

-----Subtasks-----
Subtask #1 (15 points):
- $T \le 20$
- $N \le 20$
Subtask #2 (85 points): original constraints

-----Example Input-----
3
1
1
2
2
1 2
2 1
2
1 1
2 2

-----Example Output-----
-1
0
1

-----Explanation-----
Example case 1: There is no way to make the sequences identical, so the answer is $-1$.
Example case 2: The sequence are identical initially, so the answer is $0$.
Example case 3: We can swap $A_1$ with $B_2$, which makes the two sequences identical, so the answer is $1$.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'def chef_cost(A, B, n):\n \n checksum = 0 # if count of number is even XOR = 0, else it will give a value\n \n mn1 = min(A)\n mn2 = min(B)\n \n mn = min(mn1, mn2)\n \n mpa = {}\n for i in range(n):\n  \n  checksum ^= A[i]\n  \n  if A[i] not in mpa:\n   mpa[A[i]] = 1\n  else:\n   mpa[A[i]] += 1 \n\n mpb = {}\n for i in range(n):\n  \n  checksum ^= B[i]\n  \n  if B[i] not in mpb:\n   mpb[B[i]] = 1\n  else:\n   mpb[B[i]] += 1\n   \n#     print(mpa)\n#     print(mpb)\n \n if (checksum): # numbers with odd count can never be distributed\n  return -1\n \n # removing common elements\n for i in mpa: \n  if i in mpb:\n   dx = min(mpa[i], mpb[i])\n   \n   mpa[i] -= dx\n   mpb[i] -= dx\n \n#     print(mpa)\n#     print(mpb)\n \n a1 = []\n b1 = []\n \n for i in mpa:\n  for j in range(mpa[i]//2):\n   a1.append(i)\n \n for i in mpb:\n  for j in range(mpb[i]//2):\n   b1.append(i)\n \n a1.sort()\n b1.sort(reverse=True)\n \n cost = 0\n for i in range(len(a1)):\n  cost += min(2 * mn, min(a1[i], b1[i]))\n  \n return cost\n\nt = int(input())\n\nfor _ in range(t):\n n = int(input())\n A = list(map(int, input().split()))\n B = list(map(int, input().split()))\n \n print(chef_cost(A, B, n))'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13233