#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];
}
while (q--) {
int r, v;
cin >> r >> v;
int ans = 0;
int cur = v;
int prev = d[r];
for (int i = r; i <= n; i++) {
if (d[i] < prev)
continue;
if (cur <= c[i]) {
ans = i;
break;
}
else {
cur -= c[i];
}
prev = d[i];
}
cout << ans << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1568 ms |
3608 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |