Problem
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.
Examples
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
题目大致意思为:一共有n个男生和m个女生 并给出各自的舞技数值 他们要跳舞 要求舞伴之间的舞技数值相差1 求最多能匹配多少对
//排序之后遍历over
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<limits.h>
#include<cmath>
#include<set>
#include<map>
#define ll long long
using namespace std;
int main()
{
int n, m;
vector<int>boy;
vector<int>girl;
cin >> n;
for (int i = 0; i < n; i++)
{
int x;
cin >> x;
boy.emplace_back(x);
}
cin >> m;
for (int i = 0; i < m; i++)
{
int y;
cin >> y;
girl.emplace_back(y);
}
sort(boy.begin(), boy.end());
sort(girl.begin(), girl.end());
int res = 0;
int i;
int j;
for (i = 0,j = 0; i < n && j < m;)
{
if (abs(boy[i] - girl[j]) <= 1)
{
res++;
i++;
j++;
}
else if (boy[i] < girl[j])
{
i++;
}
else
{
j++;
}
}
cout << res << endl;
return 0;
}