CCF-相邻数对

#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;

int main()
{
	int n;
	cin>>n;
	int *a=new int[n];
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sort(a,a+n);
	int *b=new int [n-1];
	int ans=0;
	for(int i=0;i<n-1;i++)
	{
		b[i]=a[i+1]-a[i];
		if(b[i]==1)
		{
			ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}