Neko Finds Grapes

## 题目描述 Neko有n个宝箱和m个钥匙，第i个箱子上写有整数a$_{i}$，第j个宝箱上写有整数b$_{j}$，Neko想要打开尽量多的宝箱。 第j个小时可以被用来打开第i个宝箱当且仅当a$_{i}$与b$_{j}$的和为奇数。一个钥匙最多仅能配对一个箱子，一个箱子最多被打开一次 请你告诉Neko他最多能打开多少个箱子。 ## 输入输出格式 第一行包括整数n和m，其中(1≤n,m≤10$^{5}$) 第二行包括n个整数a$_{1}$ ,a$_{2}$ ,a$_{3}$ ......a$_{n}$(1≤a$_{i}$≤10$^{9}$) 第三行包括m个整数b$_{1}$ ,b$_{2}$ ,b$_{3}$ ## 输出格式 输出你能打开的箱子的最大数 ......b$_{n}$(1≤b$_{i}$≤10$^{9}$)

On a random day, Neko found $ n $ treasure chests and $ m $ keys. The $ i $ -th chest has an integer $ a_i $ written on it and the $ j $ -th key has an integer $ b_j $ on it. Neko knows those chests contain the powerful mysterious green Grapes, thus Neko wants to open as many treasure chests as possible. The $ j $ -th key can be used to unlock the $ i $ -th chest if and only if the sum of the key number and the chest number is an odd number. Formally, $ a_i + b_j \equiv 1 \pmod{2} $ . One key can be used to open at most one chest, and one chest can be opened at most once. Find the maximum number of chests Neko can open.

The first line contains integers $ n $ and $ m $ ( $ 1 \leq n, m \leq 10^5 $ ) — the number of chests and the number of keys. The second line contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ 1 \leq a_i \leq 10^9 $ ) — the numbers written on the treasure chests. The third line contains $ m $ integers $ b_1, b_2, \ldots, b_m $ ( $ 1 \leq b_i \leq 10^9 $ ) — the numbers written on the keys.

Print the maximum number of chests you can open.

5 4
9 14 6 2 11
8 4 7 20

3

5 1
2 4 6 8 10
5

1

1 4
10
20 30 40 50

0

In the first example, one possible way to unlock $ 3 $ chests is as follows: - Use first key to unlock the fifth chest, - Use third key to unlock the second chest, - Use fourth key to unlock the first chest. In the second example, you can use the only key to unlock any single chest (note that one key can't be used twice). In the third example, no key can unlock the given chest.