Submission #1441086

---

Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef unsigned long long u64;

int main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  u64 n, c, k;
  cin >> n >> c >> k;
  priority_queue< u64, vector< u64 >, greater< u64 > > q;
  for (u64 i = 0; i < n; ++i) {
    u64 t;
    cin >> t;
    q.push(t);
  }
  u64 wait = q.top();
  u64 w_n = 1;
  u64 b_cnt = 0;
  q.pop();
  while (!q.empty()) {
    while (w_n < c && !q.empty()) {
      u64 next = q.top();
      if (next > wait+k) {
        break;
      }
      w_n++;
      q.pop();
    }
    if (q.empty()) break;
    b_cnt++;
    wait = q.top();
    q.pop();
    w_n = 1;
  }
  if (w_n>0) b_cnt++;
  cout << b_cnt << endl;

  return 0;
}

Submission Info

Judge Result