Submission #1758200

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#define	MOD  1000000007;
#define PI = 3.14159265358979323846;
using namespace std;

int main()
{
	long long N, K;
	cin >> N >> K;

	int a[100000], b[100000];
	map<long long, long long> mp;
	map<long long, long long>::iterator it;
	for (int i = 0; i < N; i++)
	{
		cin >> a[i] >> b[i];
		mp[a[i]] += b[i];
	}

	long long count = 0;
	for (it = mp.begin(); it != mp.end(); it++) {
		count += it->second;
		if (count >= K) {
			cout << it->first << endl;
			return 0;
		}
	}
}

Submission Info

Judge Result