Codeforces 489B. BerSU Ball 排序 指针 贪心

排序了无脑贪心了就完事了

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		while (in.hasNextInt()) {
			int n = in.nextInt();
			int[] b = new int[n];
			for (int i = 0; i < n; i++)
				b[i] = in.nextInt();
			int m = in.nextInt();
			int[] g = new int[m];
			for (int i = 0; i < m; i++)
				g[i] = in.nextInt();
			int ans = 0, i = 0, j = 0;
			Arrays.sort(b);
			Arrays.sort(g);
			while (i < n && j < m) {
				if (Math.abs(b[i]-g[j]) <= 1) {
					ans++;
					i++;
					j++;
				}
				else if (b[i] < g[j])
					i++;
				else if (b[i] > g[j])
					j++;
			}
			System.out.println(ans);
		}
	}
}