Submission #3595176

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int main(void){
    long N,K;
    long ans=0;
    cin>>N>>K;
    vector<pair<long,long> > pairs(N);
    for(long i=0;i<N;i++){
        cin>>pairs[i].first>>pairs[i].second;
    }
    sort(pairs.begin(),pairs.end());
    for(long i=0;i<N;i++){
        K=K-pairs[i].second;
        if(K<=0) {ans=pairs[i].first; break;}
    }
    cout<<ans;
    return 0;
}

Submission Info

Judge Result