Problem p03782 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
template <class T>
using reversed_priority_queue = priority_queue<T, vector<T>, greater<T>>;
typedef long long llong;
char moji[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
                 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
                 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
char moji2[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
                  'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
                  'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
char moji3[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
#define Sort(a) sort(a.begin(), a.end());
#define Reverse(a) reverse(a.begin(), a.end());
#define print(a) cout << a << endl;
#define MOD llong(1e9 + 7)
#define MAX int(2 * 1e5 + 5)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pi acos(-1.0)
#define int llong
#define INF llong(1e17)
template <class T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
bool Add(int &a, int b) { a = (a + b) % MOD; }
void myprint(int *A, int A_num) {
  REP(i, A_num) cout << A[i] << " ";
  cout << endl;
}

const int n_max = 5005;
int n, k;
int A[n_max];
int dp[n_max];

bool solve(int id) {
  REP(i, k + 1) dp[i] = false;
  dp[0] = true;
  REP(i, n) {
    if (i == id)
      continue;
    REPR(j, k) {
      if (j - A[i] < 0)
        break;
      if (dp[j - A[i]])
        dp[j] = true;
    }
  }
  bool res = false;
  FOR(i, k - A[id], k) { res |= dp[i]; }
  return res;
}

signed main() {
  cin >> n >> k;
  REP(i, n) cin >> A[i];
  sort(A, A + n);

  int l = -1;
  int r = n;
  while (l + 1 < r) {
    int mid = (l + r) / 2;
    if (solve(mid))
      r = mid;
    else
      l = mid;
  }

  cout << l + 1 << endl;
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
template <class T>
using reversed_priority_queue = priority_queue<T, vector<T>, greater<T>>;
typedef long long llong;
char moji[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
                 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
                 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
char moji2[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
                  'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
                  'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
char moji3[10] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9'};
#define Sort(a) sort(a.begin(), a.end());
#define Reverse(a) reverse(a.begin(), a.end());
#define print(a) cout << a << endl;
#define MOD llong(1e9 + 7)
#define MAX int(2 * 1e5 + 5)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pi acos(-1.0)
#define int llong
#define INF llong(1e17)
template <class T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
bool Add(int &a, int b) { a = (a + b) % MOD; }
void myprint(int *A, int A_num) {
  REP(i, A_num) cout << A[i] << " ";
  cout << endl;
}

const int n_max = 5005;
int n, k;
int A[n_max];
int dp[n_max];

bool solve(int id) {
  if (A[id] >= k)
    return true;
  REP(i, k + 1) dp[i] = false;
  dp[0] = true;
  REP(i, n) {
    if (i == id)
      continue;
    REPR(j, k) {
      if (j - A[i] < 0)
        break;
      if (dp[j - A[i]])
        dp[j] = true;
    }
  }
  bool res = false;
  FOR(i, k - A[id], k) { res |= dp[i]; }
  return res;
}

signed main() {
  cin >> n >> k;
  REP(i, n) cin >> A[i];
  sort(A, A + n);

  int l = -1;
  int r = n;
  while (l + 1 < r) {
    int mid = (l + r) / 2;
    if (solve(mid))
      r = mid;
    else
      l = mid;
  }

  cout << l + 1 << endl;
  return 0;
}