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

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int(i) = (a)-1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int(i) = (a)-1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template <typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

void solve(int n, int m) {
  using type = pair<int, pair<int, string>>;
  vector<type> gen(n);
  for_each(ALL(gen), [](type &e) {
    string s;
    int a, b;
    cin >> s >> a >> b;
    e = MP(b, MP(a, s));
  });
  SORT(gen);
  VI ids(n);
  REP(i, n) ids[i] = gen[i].first;
  REP(i, m) {
    int num;
    cin >> num;
    int idx = distance(begin(ids), lower_bound(ALL(ids), num));
    // DEBUG(idx)
    if (!(0 <= idx && idx < n)) {
      cout << "Unknown" << endl;
      continue;
    }
    auto e = gen[idx];
    int buf = e.second.first - (e.first - num);
    if (buf > 0 && e.second.first >= buf) {
      cout << e.second.second << " " << buf << endl;
    } else {
      cout << "Unknown" << endl;
    }
  }
  return;
}

signed main(void) {
  LL n, m, p, a, b, c, x, y, z, q;
  string s;
  bool f = false;
  while (cin >> n >> m, n) {
    solve(n, m);
    // return 0;
  }
}

Error: 0

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int(i) = (a)-1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int(i) = (a)-1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template <typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

void solve(int n, int m) {
  using type = pair<int, pair<int, string>>;
  vector<type> gen(n);
  for_each(ALL(gen), [](type &e) {
    string s;
    int a, b;
    cin >> s >> a >> b;
    e = MP(b, MP(a, s));
  });
  SORT(gen);
  VI ids(n);
  REP(i, n) ids[i] = gen[i].first;
  REP(i, m) {
    int num;
    cin >> num;
    int idx = lower_bound(ALL(ids), num) - begin(ids);
    auto e = gen[idx];
    if (e.second.first - (e.first - num) > 0) {
      cout << e.second.second << " " << e.second.first - (e.first - num)
           << endl;
    } else {
      cout << "Unknown" << endl;
    }
  }
  return;
}

signed main(void) {
  LL n, m, p, a, b, c, x, y, z, q;
  string s;
  bool f = false;
  while (cin >> n >> m, n) {
    solve(n, m);
    // return 0;
  }
}