https://www.acwing.com/problem/content/3586/
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10,M=5010;
int f[M][M],a[N],n,m;
int main(void)
{
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1);
for(int i=1,k=1;i<=n;i++)
{
while(a[i]-a[k]>5) k++;
for(int j=1;j<=m;j++) f[i][j]=max(f[i-1][j],f[k-1][j-1]+i-k+1);
}
cout<<f[n][m];
return 0;
}