제출 #1335069

#제출 시각아이디문제언어결과실행 시간메모리
1335069tsengangFountain (eJOI20_fountain)C++20
30 / 100
252 ms2284 KiB
#include <bits/stdc++.h>
#define ll int
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define ertunt return
using namespace std;
int main(){
    ll n,q;
    cin>>n>>q;
    vector<ll>d(n+1),c(n+1),p(n+1);
    for(ll i=1;i<=n;i++){
        cin>>d[i]>>c[i];
        p[i]=p[i-1]+c[i];
    }
    while(q--){
        ll r,v;
        cin>>r>>v;
        ll t=p[r-1]+v;
        auto it=lower_bound(p.begin()+r,p.end(),t);
        if(it==p.end()) cout<<0<<"\n";
        else cout<<(it-p.begin())<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...