Submission #1847554

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
struct f{
	int x;
	int y;
	
}ff[100005];
bool cmp(f a,f b)
{
	return a.x<a.y;
}
int main()
{
	int a,b,s=0;
	cin>>a>>b;
	for(int i =0;i<a;i++)
		cin>>ff[i].x>>ff[i].y;
	sort(ff,ff+a,cmp);
	for(int i =0;i<a;i++)
	{
		s+=ff[i].y;
		if(s>=b)
		{
			cout<<ff[i].x<<endl;
			break;
		}
	}
	return 0;
 } 

Submission Info

Judge Result