CodeForces 489B. BerSU Ball 【贪心】

B. BerSU Ball
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
inputCopy
4
1 4 6 2
5
5 1 5 7 9
output
3
inputCopy
4
1 2 3 4
4
10 11 12 13
output
0
inputCopy
5
1 1 1 1 1
3
1 2 3
output
2

思路：为了组成更多组，男生女生都排序，再一一对应着比较 。如果谁太小了，就看下一个元素可不可以和对方组队。（从小到大排序，只能让小的往后遍历找大的 而大的元素前面的较小的元素都已经处理过了，不能再使用）

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int male[105];
int fem[105];
int main()
{
    int b,g;
    cin>>b;
    int cnt = 0;
    for(int i = 0;i<b;i++)
    {
        cin>>male[i];
    }
    sort(male,male+b);
    cin>>g;
    for(int i= 0;i<g;i++)
    {
        cin>>fem[i];
    } 
    sort(fem,fem+g);
    int i = 0, j = 0;
    while(i<b&&j<g)
    {
        if(abs(male[i]-fem[j])<=1)
        {
            i++;j++;cnt++;
        }
        else if(male[i]>fem[j])
        {
            j++;
        }
        else i++;
    }
    cout<<cnt<<endl;
    return 0;

}