Problem p02557 (C++)

Buggy submission (status: Runtime Error):
// Never stop trying
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost                                                                  \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)

const int MOD = 1e9 + 7; // 998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; // right left down up

template <class T> using V = vector<T>;
template <class T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) {
  return a / b + ((a ^ b) > 0 && a % b);
} // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x, y)                                                             \
  cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v)                                                                \
  cerr << " - " << #v << " : " << endl << "[ ";                                \
  for (auto it : v)                                                            \
    cerr << it << ' ';                                                         \
  cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}

int main() {
  boost;
  IO();

  int N;
  cin >> N;
  vi a(N), b(N);
  FOR(i, 0, N) cin >> a[i];

  multiset<int> s;
  FOR(i, 0, N) cin >> b[i], s.insert(b[i]);

  vi res(N, -1);
  FOR(i, 0, N) {
    int x = a[i];
    auto it = s.begin();
    if (*it != x)
      res[i] = (*it);
    else {
      it = s.upper_bound(x);
      if (it != s.end())
        res[i] = (*it);
    }
    if (it != s.end())
      s.erase(it);
  }

  if (!s.empty()) {

    // of only one integer is remaining
    bool y = true, p = -1;
    for (auto x : s) {
      if (p != -1 && x != p)
        y = false;
      p = x;
    }
    assert(y);

    vi v;
    int x = (*s.begin());
    FOR(i, 0, N) if (res[i] != -1 && res[i] != x && a[i] != x) {
      v.pb(res[i]), res[i] = x;
      s.erase(s.begin());
      if (s.empty())
        break;
    }
    if (!s.empty()) {
      cout << "No" << endl;
      return 0;
    }

    FOR(i, 0, N) if (res[i] == -1) {
      if (v.empty()) {
        cout << "No" << endl;
        return 0;
      }
      if (a[i] != v.back()) {
        res[i] = v.back();
        v.pop_back();
      }
    }
    if (!v.empty()) {
      cout << "No" << endl;
      return 0;
    }
  }

  cout << "Yes" << endl;
  FOR(i, 0, N) cout << res[i] << ' ';
  cout << endl;

  return 0;
}

/* Careful!!!
        .Array bounds
        .Infinite loops
        .Uninitialized variables / empty containers
        .Order of input

   Some insights:
        .Binary search
        .Graph representation
        .Write brute force code
        .Change your approach
*/


Fixed submission:
// Never stop trying
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost                                                                  \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)

const int MOD = 1e9 + 7; // 998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; // right left down up

template <class T> using V = vector<T>;
template <class T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) {
  return a / b + ((a ^ b) > 0 && a % b);
} // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x, y)                                                             \
  cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v)                                                                \
  cerr << " - " << #v << " : " << endl << "[ ";                                \
  for (auto it : v)                                                            \
    cerr << it << ' ';                                                         \
  cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
}

int main() {
  boost;
  IO();

  int N;
  cin >> N;
  vi a(N), b(N);
  FOR(i, 0, N) cin >> a[i];

  multiset<int> s;
  FOR(i, 0, N) cin >> b[i], s.insert(b[i]);

  vi res(N, -1);
  FOR(i, 0, N) {
    int x = a[i];
    auto it = s.begin();
    if (*it != x)
      res[i] = (*it);
    else {
      it = s.upper_bound(x);
      if (it != s.end())
        res[i] = (*it);
    }
    if (it != s.end())
      s.erase(it);
  }

  if (!s.empty()) {

    // of only one integer is remaining
    bool y = true, p = -1;
    for (auto x : s) {
      if (p != -1 && x != p)
        y = false;
      p = x;
    }
    // assert(y);

    vi v;
    int x = (*s.begin());
    FOR(i, 0, N) if (res[i] != -1 && res[i] != x && a[i] != x) {
      v.pb(res[i]), res[i] = x;
      s.erase(s.begin());
      if (s.empty())
        break;
    }
    if (!s.empty()) {
      cout << "No" << endl;
      return 0;
    }

    FOR(i, 0, N) if (res[i] == -1) {
      if (v.empty()) {
        cout << "No" << endl;
        return 0;
      }
      if (a[i] != v.back()) {
        res[i] = v.back();
        v.pop_back();
      }
    }
    if (!v.empty()) {
      cout << "No" << endl;
      return 0;
    }
  }

  cout << "Yes" << endl;
  FOR(i, 0, N) cout << res[i] << ' ';
  cout << endl;

  return 0;
}

/* Careful!!!
        .Array bounds
        .Infinite loops
        .Uninitialized variables / empty containers
        .Order of input

   Some insights:
        .Binary search
        .Graph representation
        .Write brute force code
        .Change your approach
*/