Problem p02557 (C++) — buggy submission, verdict: Runtime Error

#include "list"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>

using namespace std;
using ll = long long;
using ull = unsigned long long;
// const ll mod = 998244353;
const ll mod = 1000000007;
const int inf = 1e9;
const ll linf = 1e18;
const int DX[] = {1, -1, 0, 0};
const int DY[] = {0, 0, 1, -1};

#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep_from(i, j, n) for (ll i = (j); i < (n); ++i)
#define rep_rev(i, n) for (ll i = n - 1; i >= 0; --i)
#define rep_from_rev(i, j, n) for (ll i = n - 1; i >= j; --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())

template <typename T> inline T chmax(T &a, const T b) {
  return a = (a < b) ? b : a;
}

template <typename T> inline T chmin(T &a, const T b) {
  return a = (a > b) ? b : a;
}

ll power(ll base, ll exponent) {
  if (exponent % 2) {
    return power(base, exponent - 1) * base % mod;
  } else if (exponent) {
    ll root_ans = power(base, exponent / 2);
    return root_ans * root_ans % mod;
  } else {
    return 1;
  }
}

ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
  if (a < b)
    gcd(b, a);
  ll r;
  while (r = a % b) {
    a = b;
    b = r;
  }
  return b;
}

template <typename T> ll sum(T begin, T end) {
  return accumulate(begin, end, 0ll);
}

template <typename T> struct combination {
  vector<ll> fact, inv;

  combination(int sz) : fact(sz + 1), inv(sz + 1) {
    fact[0] = 1;
    for (int i = 1; i <= sz; i++) {
      fact[i] = fact[i - 1] * i % mod;
    }
    inv[sz] = power(fact[sz], mod - 2);
    for (int i = sz - 1; i >= 0; i--) {
      inv[i] = inv[i + 1] * (i + 1) % mod;
    }
  }

  T C(int p, int q) const {
    if (q < 0 || p < q)
      return 0;
    return T(fact[p] * inv[q] % mod * inv[p - q] % mod);
  }

  T P(int p, int q) const {
    if (p < 0 || p < q)
      return 0;
    return T(fact[p] * inv[p - q] % mod);
  }
};

using Pair = pair<int, int>;
using LPair = pair<ll, ll>;

template <ll Modulus> struct ModInt {
  ll a;

  constexpr ModInt(const ll x = 0) noexcept : a((x % mod + mod) % mod) {}

  constexpr ll &value() noexcept { return a; }

  constexpr const ll &value() const noexcept { return a; }

  constexpr ModInt operator+(const ModInt x) const noexcept {
    return ModInt(*this) += x;
  }

  constexpr ModInt operator-(const ModInt x) const noexcept {
    return ModInt(*this) -= x;
  }

  constexpr ModInt operator*(const ModInt x) const noexcept {
    return ModInt(*this) *= x;
  }

  constexpr ModInt operator/(const ModInt x) const noexcept {
    return ModInt(*this) /= x;
  }

  constexpr ModInt &operator+=(const ModInt x) noexcept {
    a += x.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }

  constexpr ModInt &operator-=(const ModInt x) noexcept {
    if (a < x.a) {
      a += Modulus;
    }
    a -= x.a;
    return *this;
  }

  constexpr ModInt &operator*=(const ModInt x) noexcept {
    a = a * x.a % Modulus;
    return *this;
  }

  constexpr ModInt &operator/=(ModInt x) noexcept {
    ll exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= x;
      }
      x *= x;
      exp /= 2;
    }
    return *this;
  }

  constexpr ModInt operator-() noexcept { return ModInt(-a); }

  friend ostream &operator<<(ostream &os, const ModInt &m) {
    os << m.a;
    return os;
  }
};

using mint = ModInt<mod>;

int main() {
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  multiset<int> ms;
  map<int, int> mp;
  rep(i, n) {
    ms.insert(b[i]);
    mp[a[i]]++;
    mp[b[i]]++;
  }
  vector<int> ans(n);
  priority_queue<Pair> big;
  for (auto p : mp) {
    if (p.second == 2)
      continue;
    big.emplace(p.second, p.first);
  }
  rep(i, n) {
    if (big.size()) {
      auto tmp = big.top();
      big.pop();
      while (big.size() && tmp.second <= a[i] &&
             *ms.lower_bound(tmp.second) != tmp.second) {
        tmp = big.top();
        big.pop();
      }
      if (tmp.second > a[i] && *ms.lower_bound(tmp.second) == tmp.second) {
        if (tmp.first > 2)
          big.emplace(tmp.first - 2, tmp.second);
        ans[i] = tmp.second;
        ms.erase(ms.lower_bound(ans[i]));
        continue;
      }
    }
    auto f = ms.lower_bound(a[i] + 1);
    if (f == ms.end()) {
      auto p = ms.begin();
      ans[i] = *p;
      ms.erase(p);
    } else {
      ans[i] = *f;
      ms.erase(f);
    }
  }
  rep(i, n) {
    if (a[i] == ans[i] || ans[i] == 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  //  rep(i, n) cout << a[i] <<" ";cout << endl;
  rep(i, n) cout << ans[i] << " ";
  cout << endl;
}

Error: WA

Fixed submission:

#include "list"
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>

using namespace std;
using ll = long long;
using ull = unsigned long long;
// const ll mod = 998244353;
const ll mod = 1000000007;
const int inf = 1e9;
const ll linf = 1e18;
const int DX[] = {1, -1, 0, 0};
const int DY[] = {0, 0, 1, -1};

#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep_from(i, j, n) for (ll i = (j); i < (n); ++i)
#define rep_rev(i, n) for (ll i = n - 1; i >= 0; --i)
#define rep_from_rev(i, j, n) for (ll i = n - 1; i >= j; --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())

template <typename T> inline T chmax(T &a, const T b) {
  return a = (a < b) ? b : a;
}

template <typename T> inline T chmin(T &a, const T b) {
  return a = (a > b) ? b : a;
}

ll power(ll base, ll exponent) {
  if (exponent % 2) {
    return power(base, exponent - 1) * base % mod;
  } else if (exponent) {
    ll root_ans = power(base, exponent / 2);
    return root_ans * root_ans % mod;
  } else {
    return 1;
  }
}

ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
  if (a < b)
    gcd(b, a);
  ll r;
  while (r = a % b) {
    a = b;
    b = r;
  }
  return b;
}

template <typename T> ll sum(T begin, T end) {
  return accumulate(begin, end, 0ll);
}

template <typename T> struct combination {
  vector<ll> fact, inv;

  combination(int sz) : fact(sz + 1), inv(sz + 1) {
    fact[0] = 1;
    for (int i = 1; i <= sz; i++) {
      fact[i] = fact[i - 1] * i % mod;
    }
    inv[sz] = power(fact[sz], mod - 2);
    for (int i = sz - 1; i >= 0; i--) {
      inv[i] = inv[i + 1] * (i + 1) % mod;
    }
  }

  T C(int p, int q) const {
    if (q < 0 || p < q)
      return 0;
    return T(fact[p] * inv[q] % mod * inv[p - q] % mod);
  }

  T P(int p, int q) const {
    if (p < 0 || p < q)
      return 0;
    return T(fact[p] * inv[p - q] % mod);
  }
};

using Pair = pair<int, int>;
using LPair = pair<ll, ll>;

template <ll Modulus> struct ModInt {
  ll a;

  constexpr ModInt(const ll x = 0) noexcept : a((x % mod + mod) % mod) {}

  constexpr ll &value() noexcept { return a; }

  constexpr const ll &value() const noexcept { return a; }

  constexpr ModInt operator+(const ModInt x) const noexcept {
    return ModInt(*this) += x;
  }

  constexpr ModInt operator-(const ModInt x) const noexcept {
    return ModInt(*this) -= x;
  }

  constexpr ModInt operator*(const ModInt x) const noexcept {
    return ModInt(*this) *= x;
  }

  constexpr ModInt operator/(const ModInt x) const noexcept {
    return ModInt(*this) /= x;
  }

  constexpr ModInt &operator+=(const ModInt x) noexcept {
    a += x.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }

  constexpr ModInt &operator-=(const ModInt x) noexcept {
    if (a < x.a) {
      a += Modulus;
    }
    a -= x.a;
    return *this;
  }

  constexpr ModInt &operator*=(const ModInt x) noexcept {
    a = a * x.a % Modulus;
    return *this;
  }

  constexpr ModInt &operator/=(ModInt x) noexcept {
    ll exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= x;
      }
      x *= x;
      exp /= 2;
    }
    return *this;
  }

  constexpr ModInt operator-() noexcept { return ModInt(-a); }

  friend ostream &operator<<(ostream &os, const ModInt &m) {
    os << m.a;
    return os;
  }
};

using mint = ModInt<mod>;

int main() {
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  multiset<int> ms;
  map<int, int> mp;
  rep(i, n) {
    ms.insert(b[i]);
    mp[a[i]]++;
    mp[b[i]]++;
  }
  vector<int> ans(n);
  priority_queue<Pair> big;
  for (auto p : mp) {
    if (p.second == 2)
      continue;
    big.emplace(p.second, p.first);
  }
  rep(i, n) {
    if (big.size()) {
      auto tmp = big.top();
      big.pop();
      while (big.size() && tmp.second <= a[i]) {
        tmp = big.top();
        big.pop();
      }
      if (tmp.second > a[i]) {
        if (tmp.first > 2)
          big.emplace(tmp.first - 2, tmp.second);
        ans[i] = tmp.second;
        ms.erase(ms.lower_bound(ans[i]));
        continue;
      }
    }
    auto f = ms.lower_bound(a[i] + 1);
    if (f == ms.end()) {
      auto p = ms.begin();
      ans[i] = *p;
      ms.erase(p);
    } else {
      ans[i] = *f;
      ms.erase(f);
    }
  }
  rep(i, n) {
    if (a[i] == ans[i] || ans[i] == 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  //  rep(i, n) cout << a[i] <<" ";cout << endl;
  rep(i, n) cout << ans[i] << " ";
  cout << endl;
}