902A-Visiting a Friend

纪念我第一次CodeForces 的第一次掉分之旅。
本来以为是走向红名的第一步，but，凉凉送给午夜做题的我。
只会一个签到题。only one。。。

A. Visiting a Friend
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Pig is visiting a friend.

Pig’s house is located at point 0, and his friend’s house is located at point m on an axis.

Pig can use teleports to move along the axis.

To use a teleport, Pig should come to a certain point (where the teleport is located) and choose where to move: for each teleport there is the rightmost point it can move Pig to, this point is known as the limit of the teleport.

Formally, a teleport located at point x with limit y can move Pig from point x to any point within the segment [x; y], including the bounds.

Determine if Pig can visit the friend using teleports only, or he should use his car.
Input

The first line contains two integers n and m (1 ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of teleports and the location of the friend’s house.

The next n lines contain information about teleports.

The i-th of these lines contains two integers ai and bi (0 ≤ ai ≤ bi ≤ m), where ai is the location of the i-th teleport, and bi is its limit.

It is guaranteed that ai ≥ ai - 1 for every i (2 ≤ i ≤ n).
Output

Print “YES” if there is a path from Pig’s house to his friend’s house that uses only teleports, and “NO” otherwise.

You can print each letter in arbitrary case (upper or lower).
Examples
Input

3 5
0 2
2 4
3 5

Output

YES

Input

3 7
0 4
2 5
6 7

Output

NO

Note

The first example is shown on the picture below:

Pig can use the first teleport from his house (point 0) to reach point 2, then using the second teleport go from point 2 to point 3, then using the third teleport go from point 3 to point 5, where his friend lives.

The second example is shown on the picture below:

You can see that there is no path from Pig’s house to his friend’s house that uses only teleports.

题意很简单：猪正在拜访一位朋友。

猪的房子位于第0点，他的朋友的房子位于轴上的第m点。

猪可以沿着数轴，使用工具移动。
要使用工具，猪必须到达某个点（传送点所在的位置）并选择移动的位置：每个传送点都有可以移动猪的最右边的点，这个点被称为传送点的极限。猪可以移动到极限以内的任一点。
确定猪是否可以使用传送带访问该朋友

code：

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
using namespace std;

struct point{
    int st;
    int en;
}p[110];

int main()
{
    int n,m;
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&p[i].st,&p[i].en);
        }
        bool flag=false;
        if(p[0].en>=n)
        {
            flag=true;
        }
        for(int i=1;i<m;i++)
        {
            if(p[i].st>p[i-1].en)
            {
                break;
            }
            if(p[i].en<p[i-1].en)
            {
                p[i].en=p[i-1].en;
            }
            if(p[i].en>=n)
            {
                flag=true;
                break;
            }
        }
        if(p[0].st>0)
        {
            flag=false;
        }
        if(flag)
        {
            printf("YES\n");
        }
        else
        {
            printf("NO\n");
        }
    }
    return 0;
}