Submission #2214997

---

Source Code Expand

#include <set>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;
using ll = long long;
const int MAX = 100010;
ll v[MAX];

int main(void) {
    int N;
    ll K;
    cin >> N >> K;

    for (int i = 0; i < N; ++i) {
    int A, B;
    cin >> A >> B;
    v[A] += B;
    }

    for (int i = 1; i <= MAX; ++i){
    if (K <= v[i]) {
        cout << i << endl;
        break;
    }
    K -= v[i];
    }

    return 0;
}

Submission Info

Judge Result