Submission #1156589

---

Source Code Expand

#if 1
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <stack>
#include <array>
#include <deque>
#include <algorithm>
#include <utility>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <numeric>

#define in std::cin
#define out std::cout

int32_t N,C,TIMEUP;
int32_t T[100000];

int main()
{
	using std::endl;
	in.sync_with_stdio(false);
	out.sync_with_stdio(false);

	in >> N>>C>>TIMEUP;
	for (int32_t i = 0; i < N; ++i)
	{
		in >> T[i];
	}
	std::sort(T, T + N);

	int total = 1;
	auto s_time = T[0];
	auto count = 1;
	for (int32_t i = 1; i < N; ++i)
	{
		++count;
		if ((s_time + TIMEUP < T[i]) || (count > C)) {
			s_time = T[i];
			count = 1;
			++total;
		}
	}
	out << total << endl;

	return 0;
}
#endif

Submission Info

Judge Result