Submission #2408612

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX=100000;
int N,aa[MAX+1],a,b;
ll K;
int main(){
    cin>>N>>K;

    while(N--){
        cin>>a>>b;
        aa[a]+=b;
    }
    int cunt=0;
    for(int ans=1;ans<=MAX;ans++){
        
        if(cunt>=K){
            cout<<ans<<"\n";
            return 0;
        }
    }
    return 0;

}

Submission Info

Judge Result