Submission #3610687

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<pair<int, int>> plans;
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    plans.emplace_back(a, b);
  }
  sort(plans.begin(), plans.end());
  int m;
  cin >> m;
  for (int i = 0; i < m; ++i) {
    int t;
    cin >> t;
    int p1 = lower_bound(plans.begin(), plans.end(), make_pair(t, -1)) -
             plans.begin();
    int res = 2e9 + 7;
    if (p1 < plans.size()) {
      res = min(res, plans[p1].second);
    }
    if (p1 > 0) {
      res = min(res, plans[p1 - 1].second + (t - plans[p1 - 1].first));
    }
    cout << res << '\n';
  }
  return 0;
}

Submission Info

Judge Result