Problem p03780 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}

template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) {
    is >> x;
  }
  return is;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
  out << '[';
  for (T i : a) {
    out << i << ',';
  }
  out << ']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;

signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n, k;
  cin >> n >> k;
  vector<ll> a(n);
  REP(i, n) cin >> a[i];
  sort(ALL(a));

  auto check = [&](ll m) {
    vector<vector<bool>> dp(n + 1, vector<bool>(k, 0));
    dp[0][0] = 1;
    REP(i, n) {
      REP(j, k) {
        if (!dp[i][j])
          continue;
        if (i == m) {
          dp[i + 1][j] = true;
        } else {
          if (j + a[i] < k)
            dp[i + 1][j + a[i]] = true;
          dp[i + 1][j] = true;
        }
      }
    }
    FOR(i, k - a[m], k) if (dp[n][i]) return true;
    return false;
  };

  ll lb = -1, ub = n;
  while (ub - lb > 1) {
    ll mid = (lb + ub) / 2;
    if (check(mid))
      ub = mid;
    else
      lb = mid;
  }
  cout << ub << endl;

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a <= x && x < b; }
template <typename T> T ceil(T a, T b) { return a / b + !!(a % b); }

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}

template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) {
    is >> x;
  }
  return is;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &a) {
  out << '[';
  for (T i : a) {
    out << i << ',';
  }
  out << ']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;

signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n, k;
  cin >> n >> k;
  vector<ll> a(n);
  REP(i, n) cin >> a[i];
  sort(ALL(a));

  auto check = [&](ll m) {
    vector<vector<bool>> dp(n + 1, vector<bool>(k, 0));
    dp[0][0] = 1;
    REP(i, n) {
      REP(j, k) {
        if (!dp[i][j])
          continue;
        if (i == m) {
          dp[i + 1][j] = true;
        } else {
          if (j + a[i] < k)
            dp[i + 1][j + a[i]] = true;
          dp[i + 1][j] = true;
        }
      }
    }
    FOR(i, max(0LL, k - a[m]), k) if (dp[n][i]) return true;
    return false;
  };

  ll lb = -1, ub = n;
  while (ub - lb > 1) {
    ll mid = (lb + ub) / 2;
    if (check(mid))
      ub = mid;
    else
      lb = mid;
  }
  cout << ub << endl;

  return 0;
}