Submission #1697295

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

using ll = long long;
using P = pair<int, int>;

int main() {
  int N;
  ll K;
  cin >> N >> K;
  vector<P> p;
  int a, b;
  for (int i = 0; i < N; i++) {
    cin >> a >> b;
    p.push_back(P(a, b));
  }
  
  sort(p.begin(), p.end());
  ll i = 0;
  int j = 0;
  int ans;
  while (i < K) {
    i += p[j].second;
    ans = p[j].first;
    j++;
  }
  
  // 解答
  cout << ans << endl;
  
  return 0;
}

Submission Info

Judge Result