Submission #1521513

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#define p pair<int, int>
#define ll long long
using namespace std;

int main(){

  ll n, k, a, b;
  vector<p> v;
  cin >> n >> k;
  for(int i = 0; i < n; i++){
    cin >> a >> b;
    v.push_back(p(a, b));
  }
  sort(v.begin(), v.end());
  ll i, cnt;
  i = cnt = 0;
  while(1){
    cnt += v[i].second;
    if(cnt >= k){
      cout << v[i].first << endl;
      return 0;
    }
    i++;
  }
}

Submission Info

Judge Result