Submission #11356582

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;

int main() {
  ll n, k;
  cin >> n >> k;
  vector<Pll> vec(n);
  rep(i,n) cin >> vec[i].first >> vec[i].second;
  sort(vec.begin(),vec.end());
  ll cnt = 0;
  rep(i,n) {
    cnt += vec[i].second;
    if(cnt>=k) {
      cout << vec[i].first << endl;
      return 0;
    }
  }
}

Submission Info

Judge Result