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

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

#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second
#define debug(...)                                                             \\
  {                                                                            \\
    cerr << "[L" << __LINE__ << "] ";                                          \\
    _debug(__VA_ARGS__);                                                       \\
  }

template <typename T> string join(const vector<T> &v, string del = ", ") {
  stringstream s;
  for (auto x : v)
    s << del << x;
  return s.str().substr(del.size());
}
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) {
  if (v.size())
    o << "[" << join(v) << "]";
  return o;
}
template <typename T>
ostream &operator<<(ostream &o, const vector<vector<T>> &vv) {
  int l = vv.size();
  if (l) {
    o << endl;
    rep(i, l) o << (i == 0 ? "[ " : ",\\n  ") << vv[i]
                << (i == l - 1 ? " ]" : "");
  }
  return o;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
  return o << "(" << p.first << ", " << p.second << ")";
}
inline void _debug() { cerr << endl; }
template <class First, class... Rest>
void _debug(const First &first, const Rest &...rest) {
  cerr << first << " ";
  _debug(rest...);
}

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;

const double PI = (1 * acos(0.0));
const double EPS = 1e-9;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3fLL;
const ll mod = 1e9 + 7;

inline void finput(string filename) { freopen(filename.c_str(), "r", stdin); }

int main() {
  ios_base::sync_with_stdio(0);
  // finput("./input");
  int n, k;
  cin >> n >> k;
  vl A(n);
  rep(i, n) cin >> A[i];
  sort(rall(A));

  int l = 0, r = n - 1;
  ll ans = 1;
  if (k & 1)
    ans *= A[0], l = 1;
  rep(i, k / 2) {
    if (A[l] * A[l + 1] >= A[r - 1] * A[r])
      (ans *= A[l] * A[l + 1] % mod) %= mod, l += 2;
    else
      (ans *= A[r] * A[r - 1] % mod) %= mod, r -= 2;
  }
  if (ans < 0) {
    ans = 1;
    rep(i, k)(ans *= mod + A[i]) %= mod;
  }
  cout << ans << endl;
  return 0;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\\n"
const int mod = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  ll ans = 1;
  if (n == k) {
    for (int i = 0; i < n; i++) {
      ll x;
      cin >> x;
      ans *= x % mod + mod;
      ans %= mod;
    }
    cout << ans << endl;
    return 0;
  }
  vector<ll> pos, neg;
  for (int i = 0; i < n; i++) {
    ll x;
    cin >> x;
    if (x < 0)
      neg.push_back(x);
    else
      pos.push_back(x);
  }
  sort(neg.begin(), neg.end());
  sort(pos.rbegin(), pos.rend());
  if (k % 2) {
    if (pos.size() == 0) {
      for (int i = n - 1; i >= n - k; i--) {
        ans *= neg[i] % mod + mod;
        ans %= mod;
      }
      cout << ans << endl;
      return 0;
    } else {
      ans *= pos[0] % mod;
      int i = 1, indp = 1, indn = 0;
      while (i < k && indp < pos.size() && indn < neg.size()) {
        ll temp = 0;
        if (indp + 1 < pos.size())
          temp = max(pos[indp] * pos[indp + 1], temp);
        if (indn + 1 < neg.size())
          temp = max(neg[indn] * pos[indn + 1], temp);
        if (indp + 1 < pos.size() && temp == pos[indp] * pos[indp + 1])
          indp += 2;
        else
          indn += 2;
        ans *= temp % mod;
        i++;
      }
      cout << ans << endl;
      return 0;
    }
  } else {
    int i = 0, indp = 0, indn = 0;
    while (i < k && indp < pos.size() && indn < neg.size()) {
      ll temp = 0;
      if (indp + 1 < pos.size())
        temp = max(pos[indp] * pos[indp + 1], temp);
      if (indn + 1 < neg.size())
        temp = max(neg[indn] * neg[indn + 1], temp);
      if (indp + 1 < pos.size() && temp == pos[indp] * pos[indp + 1])
        indp += 2;
      else
        indn += 2;
      ans *= temp % mod;
      i += 2;
    }
    cout << ans << endl;
    return 0;
  }
  return 0;
}