BerSU Ball

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
题意
给定一组男生和女生，要求配成尽可能多的对数且每一对相差最大为1
思路
我选了男生，从左到右看每个男生
1.如果对于这个男生左右两边都有女生可以与之配对，优先选择左边的。
2.如果只有右边有可以与之配对的女生，那就毫不犹豫的选择这个女生。因为如果不选的话，留给下一个男生就有两种可能，+0或+1；+1还好，如果+0，就亏了。
总结
我归纳为：在所有适合自己的中，做出给后面留下最大选择机会的选择 的问题。
同样的还有砍树问题。
代码

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

int a[100005];
int main()
{
  int b;
  int g;cin>>b;
  int bo[105],gr[105];
  bool p[105];
  memset(p,false,sizeof(p));
  for(int i=1;i<=b;i++)
    cin>>bo[i];
    cin>>g;
  for(int i=1;i<=g;i++)
    cin>>gr[i];
  sort(bo+1,bo+1+b);
  sort(gr+1,gr+1+g);
  int all=0;
  for(int i=1;i<=b;i++)
  {
      for(int j=1;j<=g;j++)
      {
          if(bo[i]-gr[j]<=1&&bo[i]-gr[j]>=0&&!p[j])
          {p[j]=1;
             all++;
              break;
          }
          if(bo[i]-gr[j]>=-1&&bo[i]-gr[j]<=0&&!p[j])
          {
              p[j]=1;
              all++;
              break;
          }
          if(gr[j]-bo[i]>=2)
            break;
      }
  }
  cout<<all;
}