-
Notifications
You must be signed in to change notification settings - Fork 0
/
B_BerSU_Ball.cpp
59 lines (57 loc) · 1.14 KB
/
B_BerSU_Ball.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#define ll long long
#define loop(o, n) for (int i = 0; i < n; i++)
#define py cout << "YES" << endl
#define pn cout << "NO" << endl
using namespace std;
// #define m 1e9+7
ll func(ll n, ll m, vector<ll> a, vector<ll> b)
{
ll i = 0, j = 0;
ll res = 0;
sort(a.begin(), a.end());
sort(b.begin(), b.end());
while (i < n || j < m)
{
if (a[i] == b[j] || abs(a[i] - b[j]) == 1)
{
res++;
i++;
j++;
}
else if (a[i] > b[j])
j++;
else
i++;
}
return res;
}
int main()
{
int t = 1;
// cin >> t;
while (t--)
{
ll n;
cin >> n;
vector<ll> a(n);
for (auto &i : a)
cin >> i;
ll m;
cin >> m;
vector<ll> b(m);
for (auto &i : b)
cin >> i;
cout << func(n, m, a, b) << endl;
}
return 0;
}