제출 #769881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
769881		BlockOG	Fountain (eJOI20_fountain)	C++14	30 / 100	1579 ms	3604 KiB

fountain

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <cstring>
#include <set>
#include <cmath>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, q; cin >> n >> q;
    int diameters[n];
    int capacities[n];
    for (int i = 0; i < n; i++) cin >> diameters[i] >> capacities[i];
    
    for (int iq = 0; iq < q; iq++) {
        int r, d = 0, v; cin >> r >> v; r--;
        for (; r < n && v > 0; r++) {
            if (diameters[r] > d) {
                d = diameters[r];
                v -= capacities[r];
            }
        }
        
        if (r == n) cout << 0 << endl;
        else cout << r << endl;
    }
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40