Submission #3421484

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n, c;
  deque<int> dq;
  cin >> n >> c;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    dq.push_back(a);
  }
  sort(dq.begin(), dq.end());
  reverse(dq.begin(), dq.end());
  int ans = 0;
  while (!dq.empty()) {
    ans++;
    int l = dq.front();
    dq.pop_front();
    if (dq.empty()) break;
    if (l + dq.back() + 1 <= c) {
      dq.pop_back();
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result