#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int MOD = 1e9 + 7;
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,q;
cin >> n>>q;
int a[n+1]={0};
for(int i=1;i<=n;i++){
int x;cin >> x;
cin >> a[i];
a[i]+=a[i-1];
}
while(q--){
int r,v;
cin >>r >> v;
v+=a[r-1];
int ans=lower_bound(a,a+n,v)-a;
if(v>a[ans+1])ans++;
if(ans==n)ans=0;
cout<<ans<<endl;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
67 ms |
4684 KB |
Output is correct |
2 |
Correct |
74 ms |
4924 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |