文章标题

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
    int i, j, n, m;
    int sum=0;
    int a[105], b[105], book[105]={0};
    cin>>n;
    for(i=1; i<=n; i++)
        cin>>a[i];
    sort(a+1, a+n+1);
    cin>>m;
    for(j=1; j<=m; j++)
        cin>>b[j];
    sort(b+1, b+m+1);
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {
            if(abs(a[i]-b[j])<=1 && book[j]==0)
            {
                sum++;
                book[j] = 1;
                break;
            }
        }
    }
    cout<<sum;
    return 0;
}

D - BerSU Ball
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status
Description
The Berland State University is hosting a ballroom dance in celebration of its 100500-th anniversary! n boys and m 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 n boys and m girls.
Input
The first line contains an integer n (1 ≤ n ≤ 100) — the number of boys. The second line contains sequence a1, a2, …, an (1 ≤ ai ≤ 100), where ai is the i-th boy’s dancing skill.
Similarly, the third line contains an integer m (1 ≤ m ≤ 100) — the number of girls. The fourth line contains sequence b1, b2, …, bm (1 ≤ bj ≤ 100), where bj is the j-th girl’s dancing skill.
Output
Print a single number — the required maximum possible number of pairs.
Sample Input
Input
4
1 4 6 2
5
5 1 5 7 9
Output
3
Input
4
1 2 3 4
4
10 11 12 13
Output
0
Input
5
1 1 1 1 1
3
1 2 3
Output
2