Submission #2126141

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<ll, ll> P;
#define MOD (1000000007ll)
#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

int main(void){
	int n,a,i,m=0;
	ll b,cnt[123456],k;
	fill(cnt,cnt+123456,0ll);
	cin >> n >> k;
	for(i=0; i<n; ++i){
		cin >> a >> b;
		cnt[a] += b;
		m = max(m,a);
	}
	for(i=1; i<=m; ++i){
		cnt[i] += cnt[i-1];
	}
	for(i=0; i<=m; ++i){
		if(cnt[i] < k){
			continue;
		}
		cout << i << endl;
		break;
	}
	return 0;
}

Submission Info

Judge Result