题目详情题解（0）讨论（0）提交记录（0）

CF489B.BerSU Ball

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! nn boys and mm girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves.

We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one.

For each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from nn boys and mm girls.

输入格式

The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! nn boys and mm girls are already busy rehearsing waltz, minuet, polonaise and quadrille moves.

We know that several boy&girl pairs are going to be invited to the ball. However, the partners' dancing skill in each pair must differ by at most one.

For each boy, we know his dancing skills. Similarly, for each girl we know her dancing skills. Write a code that can determine the largest possible number of pairs that can be formed from nn boys and mm girls.

输出格式

Print a single number — the required maximum possible number of pairs.

输入输出样例

  • 输入#1

    4
1 4 6 2
5
5 1 5 7 9

    输出#1

    3

  • 输入#2

    4
1 2 3 4
4
10 11 12 13

    输出#2

    0

  • 输入#3

    5
1 1 1 1 1
3
1 2 3

    输出#3

    2
首页