Submission #2191213

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#include <cmath>
#include <iostream>
#include <algorithm>
#define mt(a) memset(a,0,sizeof(a))
#define ll long long
using namespace std;
int main(void)
{
	int n,c,k;
	int p[200005];
	mt(p);
	cin>>n>>c>>k;
	for(int i=1;i<=n;i++)
		cin>>p[i];
	sort(p+1,p+1+n);
	int ans = 0;
	int t = p[1];
	ll sum = 1;
	bool flag = true;
	for(int i=2;i<=n;i++)
	{
		if(sum==0)
		{
			t = p[i];
			sum++;
			continue;
		}
		if(p[i]<=t+k)
		{
			sum++;
			if(sum==c)
			{
				sum = 0;
				ans++;
				if(i==n)
					flag = false;
				//cout<<i<<endl; 
			}
		}
		else
		{
			sum = 0;
			ans++;
			//cout<<i<<endl;
		}
	}
	if(flag)
		ans++;
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result