Submission #1279086

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int n,k;
pair<int,int> p[100010];
int main(){
	cin>>n>>k;
	for(int i=0;i<n;i++){
		cin>>p[i].first>>p[i].second;
	}
	sort(p,p+n);
	int cnt=0;
	for(int i=0;i<n;i++){
		cnt+=p[i].second;
		if(cnt>=k){
			cout<<p[i].first<<endl;
			break;
		}
	}
	return 0;
}

Submission Info

Judge Result