Submission #3271650

---

Source Code Expand

#include <bits/stdc++.h>
#include <tuple>
using namespace std;
using ll = long long;

int main()
{
  int n, k;
  cin >> n >> k;
  vector<pair<int, int>> ab(n);
  for (int i = 0; i < n; ++i)
  {
    cin >> ab[i].first >> ab[i].second;
  }
  sort(ab.begin(), ab.end());
  ll res = 0;
  for (ll i = 0; i < ab.size(); ++i)
  {
    res += ab[i].second;
    if (res >= k)
    {
      cout << ab[i].first << endl;
      return 0;
    }
  }

  return 0;
}

Submission Info

Judge Result