Submission #1770572

---

Source Code Expand

#include <iostream>
#include <queue>
using namespace std;

int main(int argc, char **argv)
{

  vector<long long> count(1000000, 0);
  int N;
  long long K;
  cin >> N >> K;
  for (int i = 0; i < N; ++i) {
    int a, b;
    cin >> a >> b;
    count[a] += b;
  }
  long long tmp_count = 0;
  int val = 0;
  // int pre_val = 0;
  while (tmp_count < K) {
    val++;
    tmp_count += count[val];
    // if (count[val] > 0) pre_val = val;
  }
  cout << val << endl;

  return 0;
}

Submission Info

Judge Result