Submission #840774

#TimeUsernameProblemLanguageResultExecution timeMemory
840774Andrijanikolic73Fountain (eJOI20_fountain)C++17
30 / 100
1558 ms5360 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...