BerSU Ball
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 a 1, a 2, …, a n (1 ≤ a i ≤ 100), where a i 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 b 1, b 2, …, b m (1 ≤ b j ≤ 100), where b j 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
思路:感觉思路还是容易想到的,有点像归并排序
import java.util.Arrays;
import java.util.Scanner;
public class F {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int boy = sc.nextInt();
int[] arrb = new int[boy];
for (int i = 0; i < arrb.length; i++) {
arrb[i] = sc.nextInt();
}
int gril = sc.nextInt();
int[] arrg = new int[gril];
for (int i = 0; i < arrg.length; i++) {
arrg[i] = sc.nextInt();
}
Arrays.sort(arrb);
Arrays.sort(arrg);
int indexb = 0;
int indexg = 0;
int cnt = 0;
while(true) {
if(arrg[indexg] == arrb[indexb] || arrg[indexg] - 1 == arrb[indexb] || arrg[indexg] + 1 == arrb[indexb]) {
cnt++;
indexg++;
indexb++;
}else if(arrg[indexg] + 1 < arrb[indexb]) {//女孩小
indexg++;
}else if(arrg[indexg] > arrb[indexb] + 1) {//男孩小
indexb++;
}
if(indexg == arrg.length || indexb == arrb.length) break;
}
System.out.println(cnt);
sc.close();
}
}