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.
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.
Print a single number — the required maximum possible number of pairs.
4 1 4 6 2 5 5 1 5 7 9
3
4 1 2 3 4 4 10 11 12 13
0
5 1 1 1 1 1 3 1 2 3
2
题意:让你在两个数组中找两个数的差值<=1的配对组数。做法:两个数组排序一下,然后搜索一下就ok。#include <iostream> #include <cstdio> #include <climits> #include <cstring> #include <cstdlib> #include <cmath> #include <vector> #include <queue> #include <map> #include <set> #include <algorithm> #include<ctime> #define esp 1e-6 #define LL long long #define inf 0x0f0f0f0f using namespace std; int main() { int b[105],g[105],vis[105]; int n,m; int i,j; while(scanf("%d",&n)!=EOF) { memset(vis,0,sizeof(vis)); for(i=0;i<n;i++) scanf("%d",&b[i]); scanf("%d",&m); for(i=0;i<m;i++) scanf("%d",&g[i]); int ans; ans=0; sort(b,b+n); sort(g,g+m); for(i=0;i<n;i++) for(j=0;j<m;j++) { if(abs(b[i]-g[j])<=1&&vis[j]==0) { ans++; vis[j]=1; break; } } printf("%d\n",ans); } }