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 int long long
using namespace std;
signed main(){
int n,q;
cin>>n>>q;
int koliko[n+1];
int staje[n+1];
for(int i=1;i<=n;i++)cin>>koliko[i]>>staje[i];
while(q--){
int r,k;
cin>>r>>k;
vector<int>R;
int z=r;
R.push_back(r);
for(int i=z;i<n;i=z){
//cout<<i<<" ";
int ok=0;
for(int j=i+1;j<=n;j++){
if(koliko[i]<koliko[j]){
ok=1;
z=j;
R.push_back(j);
break;
}
}
if(!ok)break;
}
int ans=0;
for(auto it:R){
k-=staje[it];
if(k<=0){
ans=it;
break;
}
}
cout<<ans;
cout<<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... |