Submission #43365543

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;


int64_t solve(int N, int64_t K, const std::vector<int64_t> &a, const std::vector<int64_t> &b) {
    long int current_pill = 0;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> schedules;

    REP(i, N){
        auto pair = make_pair(a[i], b[i]);
        current_pill += pair.second;
        schedules.push(pair);
    }

    int last_date = 0;
    while (current_pill > K) {
        auto top = schedules.top();
        schedules.pop();

        current_pill -= top.second;
        last_date = top.first;
    }

    return last_date + 1;
}

// generated by oj-template v4.8.1 (https://github.com/online-judge-tools/template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    int64_t K;
    std::cin >> N;
    std::vector<int64_t> a(N), b(N);
    std::cin >> K;
    REP (i, N) {
        std::cin >> a[i] >> b[i];
    }
    auto ans = solve(N, K, a, b);
    std::cout << ans << '\n';
    return 0;
}

Submission Info

Judge Result