#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const ll sz=100005;
ll l[sz], s[sz], ss[sz];
set<ll>st;
map<ll, ll>mp;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll n, q;
cin>>n>>q;
for(int i=1; i<=n; i++){
cin>>l[i]>>s[i];
ss[i]=ss[i-1]+s[i];
st.insert(ss[i]);
mp[ss[i]]=i;
}
while(q--){
ll in, k;
cin>>in>>k;
ll f=ss[in-1]+k;
auto it=st.lower_bound(f);
if(it==st.end()){
cout<<0<<endl;
}
else{
cout<<mp[*it]<<endl;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
111 ms |
16444 KB |
Output is correct |
2 |
Correct |
124 ms |
15832 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |