Submission #1289066

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n;
ll k;
pair<int, ll> p[100005];

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n >> k;
	FOR(i, n) {
		cin >> p[i].first >> p[i].second;
 	}
 	sort(p, p + n);
 	ll sum = 0, ans;
 	FOR(i, n) {
 		sum += p[i].second;
 		if (k <= sum) {
 			ans = p[i].first;
 			break;
 		}
 	}
 	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result