#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, q;
cin >> n >> q;
vector<int> d(n+1), c(n+1);
for (int i = 1; i <= n; i++) {
cin >> d[i] >> c[i];
}
vector<int> ps;
ps.push_back(0);
for (int i = 1; i <= n; i++) {
ps.push_back(c[i]+ps.back());
}
while (q--) {
int r, v;
cin >> r >> v;
int ans = 0;
int x = ps[r-1];
auto it = lower_bound(ps.begin(), ps.end(), x+v);
if (it != ps.end())
ans = it-ps.begin();
cout << ans << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
44 ms |
5104 KB |
Output is correct |
2 |
Correct |
47 ms |
5332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |