CF1515D.Phoenix and Socks

To satisfy his love of matching socks, Phoenix has brought his $n$ socks ($n$ is even) to the sock store. Each of his socks has a color $c_i$ and is either a left sock or right sock.

Phoenix can pay one dollar to the sock store to either:

• recolor a sock to any color $c'$ $(1 \le c' \le n)$
• turn a left sock into a right sock
• turn a right sock into a left sock

The sock store may perform each of these changes any number of times. Note that the color of a left sock doesn't change when it turns into a right sock, and vice versa.

A matching pair of socks is a left and right sock with the same color. What is the minimum cost for Phoenix to make $n/2$ matching pairs? Each sock must be included in exactly one matching pair.

为了满足自己对搭配袜子的热爱，凤凰带着他的 $n$ 只袜子（$n$ 为偶数）来到了袜子店。他每只袜子都有一个颜色 $c_i$，且要么是左袜，要么是右袜。

凤凰可以向袜子店支付一美元来执行以下任意一种操作：

• 将一只袜子重新染色为任意颜色 $c'$（其中 $1 \le c' \le n$）；
• 将一只左袜变为右袜；
• 将一只右袜变为左袜。

袜子店可以对上述每种操作执行任意多次。注意：当左袜变为右袜（或右袜变为左袜）时，其颜色保持不变。

一双匹配的袜子指的是一只左袜和一只右袜，且二者颜色相同。凤凰最少需要花费多少美元，才能恰好组成 $n/2$ 双匹配的袜子？每只袜子必须且仅能出现在一双匹配中。

The input consists of multiple test cases. The first line contains an integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The first line of each test case contains three integers $n$, $l$, and $r$ ($2 \le n \le 2 \cdot 10^5$; $n$ is even; $0 \le l, r \le n$; $l+r=n$) — the total number of socks, and the number of left and right socks, respectively.

The next line contains $n$ integers $c_i$ ($1 \le c_i \le n$) — the colors of the socks. The first $l$ socks are left socks, while the next $r$ socks are right socks.

It is guaranteed that the sum of $n$ across all the test cases will not exceed $2 \cdot 10^5$.

输入包含多个测试用例。第一行包含一个整数 $t$（$1 \le t \le 1000$），表示测试用例的数量。

每个测试用例的第一行包含三个整数 $n$、$l$ 和 $r$（$2 \le n \le 2 \cdot 10^5$；$n$ 为偶数；$0 \le l, r \le n$；且 $l+r=n$），分别表示袜子的总数、左袜子数量和右袜子数量。

下一行包含 $n$ 个整数 $c_i$（$1 \le c_i \le n$），表示每只袜子的颜色。其中前 $l$ 只袜子为左袜子，后 $r$ 只袜子为右袜子。

保证所有测试用例中 $n$ 的总和不超过 $2 \cdot 10^5$。

For each test case, print one integer — the minimum cost for Phoenix to make $n/2$ matching pairs. Each sock must be included in exactly one matching pair.

对于每个测试用例，输出一个整数——凤凰制作 $n/2$ 对匹配袜子的最小花费。每只袜子必须且仅能出现在一对匹配中。

In the first test case, Phoenix can pay $2$ dollars to:

• recolor sock $1$ to color $2$
• recolor sock $3$ to color $2$

There are now $3$ matching pairs. For example, pairs $(1, 4)$, $(2, 5)$, and $(3, 6)$ are matching.

In the second test case, Phoenix can pay $3$ dollars to:

• turn sock $6$ from a right sock to a left sock
• recolor sock $3$ to color $1$
• recolor sock $4$ to color $1$

There are now $3$ matching pairs. For example, pairs $(1, 3)$, $(2, 4)$, and $(5, 6)$ are matching.

在第一个测试用例中，Phoenix 可以支付 $2$ 美元来：

• 将袜子 $1$ 重新染色为颜色 $2$
• 将袜子 $3$ 重新染色为颜色 $2$

此时共有 $3$ 对匹配的袜子。例如，对 $(1, 4)$、$(2, 5)$ 和 $(3, 6)$ 均为匹配对。

在第二个测试用例中，Phoenix 可以支付 $3$ 美元来：

• 将袜子 $6$ 从右袜变为左袜
• 将袜子 $3$ 重新染色为颜色 $1$
• 将袜子 $4$ 重新染色为颜色 $1$

此时共有 $3$ 对匹配的袜子。例如，对 $(1, 3)$、$(2, 4)$ 和 $(5, 6)$ 均为匹配对。