This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, q;
cin>>n>>q;
ll D[n], C[n], R[q], V[q], pref[n + 1];
for (int i = 0; i < n; i++) cin>>D[i]>>C[i];
for (int i = 0; i < n; i++) pref[i + 1] = pref[i] + C[i];
for (int i = 0; i < q; i++)
{
cin>>R[i]>>V[i];
cout<<lower_bound(pref, pref + n + 1, pref[R[i] - 1] + V[i]) - pref<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |