1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
long long n, s, l, r, najmn, x;
int m;
pair<long long, long long> p[10000];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> s;
    for (int i=0; i<m; i++)
    {
        cin >> l >> r;
        p[i] = make_pair(l,r);
    }

    sort(p, p+m);

    long long najd = 1000000000000000000;


    if(p[0].first>1)
    {
        for (long long j=1; j<p[0].first; j++)
        {
            x = abs(s-j);
            if(x<najd)
            {
                najd = x;
                najmn = j;
            }
        }
    }

    for (int i=1; i<m; i++)
    {
        for (long long j=p[i-1].second+1; j<p[i].first; j++)
        {
            x = abs(s - j);
            if(x < najd)
            {
                najd = x;
                najmn = j;
            }
        }
    }

    if(p[m-1].second < n)
    {
        for (long long j=p[m-1].second+1; j<=n; j++)
        {
            long long x = abs(s - j);
            if(x<najd)
            {
                najd = x;
                najmn = j;
            }
        }
    }

    cout << najmn;
    return 0;
}