제출 #1024656

#제출 시각아이디문제언어결과실행 시간메모리
1024656vjudge1Fountain (eJOI20_fountain)C++17
30 / 100
1567 ms3088 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin>>n>>q;
    long long int d[n], c[n];
    for(int i=0; i<n; i++)
    {
        cin>>d[i]>>c[i];
    }
    while(q--)
    {
        long long int nivo, voda;
        cin>>nivo>>voda;
        long long int curr=nivo, prev=d[nivo-1];
        voda-=c[nivo-1];
        bool kiki=0;
        for(int i=nivo; i<n; i++)
        {
            if(d[i]>prev && voda>0)
            {
                prev=d[i];
                voda-=c[i];
                curr=i+1;
            }
            if(voda<=0)
            {
                kiki=1;
            }
        }
        if(kiki)
            cout<<curr<<"\n";
        else
            cout<<0<<"\n";
    }
    

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...