RT 跪求大佬

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e5+10;
int n;
int a[maxn],vis[maxn];
signed main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1);
	int ans=0x3f3f3f3f,cnt=0;
	while(cnt<n)
	{
		int siz=0,last=0x3f3f3f3f;
		for(int i=1;i<=n;i++)
		{
			if(vis[i]||a[i]==last) continue;
			if(last==0x3f3f3f3f||a[i]==last+1)
			{
				last=a[i];vis[i]=1;siz++;cnt++;
			}
			else break;
		}
		ans=min(ans,siz);
	}
	printf("%d",ans);
	return 0;
}