Problem p03128 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (int i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \
  sort(A, A + N,                                                               \
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \
  cout << #v << ":";                                                           \
  for (auto x : v) {                                                           \
    cout << x << ' ';                                                          \
  }                                                                            \
  cout << endl;
#define endl '\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

ll dp[1007], C[13];
map<ll, ll> M;
string S, D;

int main() {
  ll N, T, A[13], B[13];
  D = "0123456789";
  B[1] = 2;
  B[2] = 5;
  B[3] = 5;
  B[4] = 4;
  B[5] = 5;
  B[6] = 6;
  B[7] = 3;
  B[8] = 7;
  B[9] = 6;
  cin >> N >> T;
  S.clear();
  rep(i, T) {
    cin >> A[i];
    C[A[i]]++;
    M[B[A[i]]]++;
  }
  Rep(i, 1, N + 1) {
    Rep(j, 2, 8) {
      if (M[j] > 0 && i - j >= 0) {
        if (i - j == 0 || dp[i - j] != 0) {
          dp[i] = max(dp[i - j] + 1, dp[i]);
        }
      }
    }
  }
  while (N > 0) {
    rRep(i, 9, 1) {
      if (N - B[i] >= 0) {
        if (C[i] > 0 && dp[N] == dp[N - B[i]] + 1 &&
            (dp[N] != 1 || N - B[i] == 0)) {
          S = S + D[i];
          N = N - B[i];
          break;
        }
      }
    }
  }

  cout << S << endl;
}

Fixed submission:
#include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (int i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \
  sort(A, A + N,                                                               \
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \
  cout << #v << ":";                                                           \
  for (auto x : v) {                                                           \
    cout << x << ' ';                                                          \
  }                                                                            \
  cout << endl;
#define endl '\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

ll dp[10007], C[13];
map<ll, ll> M;
string S, D;

int main() {
  ll N, T, A[13], B[13];
  D = "0123456789";
  B[1] = 2;
  B[2] = 5;
  B[3] = 5;
  B[4] = 4;
  B[5] = 5;
  B[6] = 6;
  B[7] = 3;
  B[8] = 7;
  B[9] = 6;
  cin >> N >> T;
  S.clear();
  rep(i, T) {
    cin >> A[i];
    C[A[i]]++;
    M[B[A[i]]]++;
  }
  Rep(i, 1, N + 1) {
    Rep(j, 2, 8) {
      if (M[j] > 0 && i - j >= 0) {
        if (i - j == 0 || dp[i - j] != 0) {
          dp[i] = max(dp[i - j] + 1, dp[i]);
        }
      }
    }
  }
  while (N > 0) {
    rRep(i, 9, 1) {
      if (N - B[i] >= 0) {
        if (C[i] > 0 && dp[N] == dp[N - B[i]] + 1 &&
            (dp[N] != 1 || N - B[i] == 0)) {
          S = S + D[i];
          N = N - B[i];
          break;
        }
      }
    }
  }

  cout << S << endl;
}