Submission #2227214

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)

using namespace std;
typedef long long int lli;

const int MAX = 1e5;
int main() {
	lli N, K;
		cin >> N >> K;
	lli a[MAX], b[MAX];
	rep(i, N) cin >> a[i] >> b[i];

	lli sum = 0;
	rep(i, N) {
		sum += b[i];
		if (K <= sum) {
			cout << a[i];
			break;
		}
	}
}

Submission Info

Judge Result