Submission #3271797

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)

ll mod = 1e09 + 7;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n, k;
  cin >> n >> k;
  ll a[n], b[n];
  map<ll, ll> mp;

  REP(i, n){
    cin >> a[i] >> b[i];
    mp[a[i]] += b[i];
  }

  ll cnt = 0;

  REP(i, mp.size()){
    cnt += mp[i];
    if(k <= cnt){
      cout << i << endl;
      return 0;
    }
  }

}

Submission Info

Judge Result