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 = 'for _ in range(int(input())):\n n = int(input())\n listt1 = [int(e) for e in input().split()]\n listt2 = [int(e) for e in input().split()]\n m = min(min(listt1), min(listt2))\n dic = {}\n flag, flag2 = True, True\n for e in listt1:\n  if e not in dic:\n   dic[e] = 1\n  else:\n   dic[e] += 1\n for e in listt2:\n  if e not in dic:\n   dic[e] = 1\n  else:\n   dic[e] += 1\n for e in dic:\n  if dic[e] % 2 == 1:\n   flag = False\n dic2 = {}\n listt1.sort()\n listt2.sort()\n for e in dic:\n  if dic[e] % 2:\n   flag2 = False\n   break\n  else:\n   dic2[e] = dic[e] // 2\n if flag2 == 0:\n  print(-1)\n  continue\n ref = dic2.copy()\n\n listt11 = []\n listt22 = []\n for i in range(0, n):\n  if ref[listt1[i]]:\n   ref[listt1[i]] -= 1\n  else:\n   listt11.append(listt1[i])\n ref = dic2.copy()\n for i in range(0, n):\n  if ref[listt2[i]]:\n   ref[listt2[i]] -= 1\n  else:\n   listt22.append(listt2[i])\n if len(listt11) == 0:\n  print(0)\n  continue\n if len(listt11) != len(listt22):\n  print(-1)\n  continue\n final_value = 0\n listt11.sort()\n listt22.sort(reverse=True)\n for i in range(0, len(listt11)):\n  final_value += min(2 * m, min(listt11[i], listt22[i]))\n print(final_value)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14223