# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
466687 | 2021-08-20T07:54:35 Z | Em1L | Fountain (eJOI20_fountain) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; void fastIO() { sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); } int main() { int n, q, vol, pos; cin >> n >> q; vector < pair <int, int> > v(n); vector < int > pour(n); for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; for (int i = 0; i < n; i++) for (int j = i; j <= n; j++) { if (j == n) { pour[i] = -1; break; } pour[i] = j; if (v[i].first < v[j].first) break; } for (int i = 0; i < q; i++) { cin >> pos >> vol; pos--; while (pos != -1) { vol -= v[pos].second; if (vol <= 0) break; pos = pour[pos]; } cout << pos + 1 << '\n'; } }