#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i, n) for(ll i = 0;i < n;i++) #define REPR(i, n) for(ll i = n;i >= 0;i--) #define FOR(i, m, n) for(ll i = m;i < n;i++) #define FORR(i, m, n) for(ll i = m;i >= n;i--) #define REPO(i, n) for(ll i = 1;i <= n;i++) #define ll long long #define INF (ll)1 << 60 #define MINF (-1 * INF) #define ALL(n) n.begin(),n.end() #define MOD 1000000007 #define P pair mapm; int main() { ll n, k, now = 0; cin >> n >> k; REP(i, n) { ll a, b; cin >> a >> b; m[a]++; m[b + 1]--; } REP(i, 1e9 + 100) { now += m[i]; if (now >= k) { cout << i << endl; return 0; } m[i + 1] += m[i]; } }