Submission #1382912

---

Source Code Expand

#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
int main() {
	typedef long long ll;
	ll n, k; cin >> n >> k;
	ll ar[114514];
	set<ll>s;
	for (ll i = 0; i < 114513; i++)ar[i] = 0;
	for (ll i = 0; i < n; i++){
		ll a, b; cin >> a >> b;
		s.insert(a);
		ar[a] += b;
	}
	ll now = 0;
	for (auto i = s.begin(); i != s.end(); i++){
		now += ar[*i];
		if (now >= k) {
			cout << *i << endl;
			return 0;
		}
	}
}

Submission Info

Judge Result