#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=3e5+10;
struct nd{int a,b;}m[N];int pre[N];
signed main()
{
	int n,k;scanf("%lld%lld",&n,&k);k=-k;
	for(int i=1;i<=n;i++)
		scanf("%lld%lld",&m[i].a,&m[i].b),k+=m[i].b;
	sort(m+1,m+n+1,[](nd n1,nd n2){return n1.a<n2.a;});
	for(int i=1;i<=n;i++)pre[i]=pre[i-1]+m[i].b;
	int id=lower_bound(pre,pre+n+1,k)-pre;
	printf("%lld\n",m[id].a+1);return 0;
}