Submission #1846865

---

Source Code Expand

#include <cstdio>
#include <iostream> 
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
 
using namespace std;
using ll = long long;
 
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
 
int main()
{
	int n, k, a, b, i, m = 0;
	pair<int, int> p[100001];

	cin >> n >> k;
	for(i = 0; i < n; i++){
		cin >> a >> b;
		p[i] = make_pair(a, b);
	}

	sort(p, p + n);

	for(i = 0; i < n; i++){
		m += p[i].second;
		if(m >= k){
			break;
		}
	}

	cout << p[i - 1].first << endl;
}

Submission Info

Judge Result