Submission #1773604

---

Source Code Expand

#include<iostream>
#include<algorithm>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

ll N, K;
P in[100000];

int main() {
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		ll a, b;
		cin >> a >> b;
		in[i] = P(a, b);
	}

	sort(in, in + N);

	ll ct = 0;
	for (int i = 0; i < N; i++) {
		if (ct <= K && K <= ct + in[i].second) {
			cout << in[i].first << endl;
			break;
		}
		ct += in[i].second;
	}

	return 0;
}

Submission Info

Judge Result