Submission #1281477

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

int N, K;
int C[100001];
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> K;
  vector<P> q;
  rep(i, N) {
    int a, b;
    cin >> a >> b;
    C[a] += b;
  }
  for (int i=1; i<=100000; i++) {
    K -= C[i];
    if (K <= 0) {
      cout << i << "\n";
      return 0;
    }
  }
  return 1;
}

Submission Info

Judge Result