inputs = [int(num) for num in input().split()]
n = inputs[0]
m = inputs[1]
inputs1 = [int(num) for num in input().split()]
start=inputs1[0]
max1 = inputs1[1]
if(start>0):
print("NO")
else:
i=1
for i in range(1,n):
inputs1 = [int(num) for num in input().split()]
if(inputs1[0]>max1):
break;
else:
if(inputs1[1]>max1):
max1=inputs1[1]
if(max1>=m):
break
if(max1>=m):
print("YES")
else:
print("NO")#include <bits/stdc++.h>
#define int long long
#define float long double
#define testcases \
int T; \
cin >> T; \
for (int t = 0; t < T; t++) \
{ \
solve(); \
}
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL)
#define endl '\n'
#define tupsort(tupname, num) sort(tupname.begin(), tupname.end(), [num](const auto &lhs, const auto &rhs) { return get<num>(lhs) < get<num>(rhs); })
using namespace std;
const int INF = 2e9;
const int M = 1e9 + 7;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef map<int, int> mii;
void solve()
{
int n, m;
cin >> n >> m;
vector<pii> vec(n);
for (int i = 0; i < n; i++)
{
cin >> vec[i].first >> vec[i].second;
}
int maxi = 0;
for (int i = 0; i < n; i++)
{
if (maxi < vec[i].first)
{
cout << "NO\n";
return;
}
if (vec[i].second >= m)
{
cout << "YES\n";
return;
}
maxi = max(maxi, vec[i].second);
}
cout << "NO\n";
}
int32_t main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
fast;
// testcases;
solve();
}590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |