Submission #43360062

---

Source Code Expand

import std;

void read(T...)(string S, ref T args) {
    auto buf = S.split;
    foreach (i, ref arg; args) {
        arg = buf[i].to!(typeof(arg));
    }
}

struct pair {
    int a;
    int b;
}

void main () {
    int N, K; readln.read(N, K);
    pair[] medicine = new pair[](N);
    foreach (i; 0..N) {
        readln.read(medicine[i].a, medicine[i].b);
    }

    solve(N, K, medicine);
}

void solve (int N, int K, pair[] medicine) {
    medicine.sort!((x, y) => x.a < y.a);
    import std.algorithm : reduce;
    long medicineSum = reduce!((x, y) => x + y.b)(0L, medicine);

    // 初日チェック
    if (medicineSum <= K) {
        writeln(1);
        return;
    }

    foreach (i; 0..N) {
        medicineSum -= medicine[i].b;
        if (medicineSum <= K) {
            writeln(medicine[i].a+1);
            break;
        }
    }
}

Submission Info

Judge Result