Problem p03089 (C++)

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

using i64 = int64_t;

#define rep(i, x, y)                                                           \
  for (i64 i = i64(x), i##_max_for_repmacro = i64(y);                          \
       i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

const int inf = 1.01e9;
const i64 inf64 = 4.01e18;
const double eps = 1e-9;

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "[";
  for (const auto &v : vec) {
    os << v << ",";
  }
  os << "]";
  return os;
}

template <typename T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

void solve() {
  // const i64 mod = 1'000'000'007;
  i64 N;
  cin >> N;

  vector<i64> b(N);
  rep(i, 0, N) {
    cin >> b[i];
    --b[i];
  }

  vector<i64> cnt(N);
  rep(i, 0, N) { ++cnt[b[i]]; }

  rep(i, 0, N) {
    if (cnt[i] > N - i) {
      cout << -1 << endl;
      return;
    }
  }

  vector<i64> v = b, ans;
  rep(i, 0, N) {
    i64 maxi = -1, pos = -1;
    rep(j, 0, v.size()) {
      if (j != v[j])
        continue;
      if (maxi < v[j]) {
        maxi = v[j];
        pos = j;
      }
    }
    if (maxi > N - 1 - i) {
      cout << -1 << endl;
      return;
    }
    ans.emplace_back(v[pos]);
    v.erase(begin(v) + pos);
  }

  reverse(begin(ans), end(ans));
  rep(i, 0, N) { cout << ans[i] + 1 << endl; }
}

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(16);
  solve();
  return 0;
}


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

using i64 = int64_t;

#define rep(i, x, y)                                                           \
  for (i64 i = i64(x), i##_max_for_repmacro = i64(y);                          \
       i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

const int inf = 1.01e9;
const i64 inf64 = 4.01e18;
const double eps = 1e-9;

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "[";
  for (const auto &v : vec) {
    os << v << ",";
  }
  os << "]";
  return os;
}

template <typename T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

void solve() {
  // const i64 mod = 1'000'000'007;
  i64 N;
  cin >> N;

  vector<i64> b(N);
  rep(i, 0, N) {
    cin >> b[i];
    --b[i];
  }

  vector<i64> cnt(N);
  rep(i, 0, N) { ++cnt[b[i]]; }

  rep(i, 0, N) {
    if (cnt[i] > N - i) {
      cout << -1 << endl;
      return;
    }
  }

  vector<i64> v = b, ans;
  rep(i, 0, N) {
    i64 maxi = -1, pos = -1;
    rep(j, 0, v.size()) {
      if (j != v[j])
        continue;
      if (maxi < v[j]) {
        maxi = v[j];
        pos = j;
      }
    }
    if (maxi > N - 1 - i or pos == -1) {
      cout << -1 << endl;
      return;
    }
    ans.emplace_back(v[pos]);
    v.erase(begin(v) + pos);
  }

  reverse(begin(ans), end(ans));
  rep(i, 0, N) { cout << ans[i] + 1 << endl; }
}

int main() {
  std::cin.tie(0);
  std::ios::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(16);
  solve();
  return 0;
}