Submission #1688533

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const ld PI=abs(acos(-1));
int a,b,n;
ll k;
vector<pair<int,int>> vec;

int main(){
	cin >> n >> k;
	REP(i,0,n) cin >> a >> b,vec.push_back(make_pair(a,b));
	sort(vec.begin(),vec.end());
	
	ll pos=0;
	REP(i,0,vec.size()){
		pos+=vec[i].second;
		if(k<=pos){
			cout << vec[i].first << endl;
			return 0;
		}
	}
	
	return 0;
}

Submission Info

Judge Result