n,m = map(int,input().split(" "))
l1 = []
l2 = []
for i in range(n):
c,d = map(int,input().split(" "))
l1.append(c)
l2.append(d)
for i in range(n):
if(l1[i] > l2[i]):
s = l1[i]
l1[i] = l2[i]
l2[i] = s
l1.sort()
l2.sort()
a = l1[n-1]
b = l2[0]
if(a>b):
print(-1)
elif(a > m):
print(a-m)
elif(b < m):
print(m-b)
else:
print(0)
#include <cstdio>
int main(){
int n, x0; scanf("%d %d\n", &n, &x0);
int m(0), M(1001);
while(n--){
int a, b; scanf("%d %d\n", &a, &b);
if(a > b){int temp(a); a = b; b = temp;}
if(b < M){M = b;}
if(a > m){m = a;}
}
if(m > M){puts("-1");}
else{
int ans = 1001;
if(m <= x0 && x0 <= M){ans = 0;}
if(x0 < m && ans > m - x0){ans = m - x0;}
if(x0 > M && ans > x0 - M){ans = x0 - M;}
printf("%d\n", ans);
}
return 0;
}1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |