Problem p03033 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x, vector<x>, greater<x>>
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
#define vtpl(x, y, z) vector<tuple<x, y, z>>
#define rev(x) reverse(x);
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
using vpl = vector<pl>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  ll n, q;
  cin >> n >> q;
  vector<pair<ll, pl>> w(n);
  rep(i, n) {
    cin >> w[i].se.fi >> w[i].se.se >> w[i].fi;
    w[i].se.fi -= w[i].fi;
    w[i].se.se -= w[i].fi + 1;
  }
  sort(all(w));
  vector<ll> que(q), ans(q);
  rep(i, q) cin >> que[i];
  set<ll> st;
  rep(i, q) st.ins(que[i]);
  rep(i, n) {
    auto p = st.lower_bound(w[i].se.fi);
    while (*p <= w[i].se.se) {
      ll id = lower_bound(all(que), *p) - que.begin();
      ans[id] = w[i].fi;
      p = st.erase(p);
      if (p == st.end())
        break;
    }
  }
  rep(i, q) {
    if (ans[i])
      cout << ans[i] << endl;
    else
      cout << -1 << endl;
  }
}

Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x, vector<x>, greater<x>>
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
#define vtpl(x, y, z) vector<tuple<x, y, z>>
#define rev(x) reverse(x);
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
using vpl = vector<pl>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  ll n, q;
  cin >> n >> q;
  vector<pair<ll, pl>> w(n);
  rep(i, n) {
    cin >> w[i].se.fi >> w[i].se.se >> w[i].fi;
    w[i].se.fi -= w[i].fi;
    w[i].se.se -= w[i].fi + 1;
  }
  sort(all(w));
  vector<ll> que(q), ans(q);
  rep(i, q) cin >> que[i];
  set<ll> st;
  rep(i, q) st.ins(que[i]);
  rep(i, n) {
    auto p = st.lower_bound(w[i].se.fi);
    if (p == st.end())
      continue;
    while (*p <= w[i].se.se) {
      ll id = lower_bound(all(que), *p) - que.begin();
      ans[id] = w[i].fi;
      p = st.erase(p);
      if (p == st.end())
        break;
    }
  }
  rep(i, q) {
    if (ans[i])
      cout << ans[i] << endl;
    else
      cout << -1 << endl;
  }
}