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
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int MX = 1000010;
vector<pair<long long, long long> > vp;

int main()
{
    long long n,s,l,r,res=1,msf=10000000000000000LL;

    int m;
    cin>>n>>m>>s;
    vp.resize(m+2);
    for (int i =0; i<m; i++)
    {
        cin>>l>>r;
        vp[i] = make_pair(l, r);

    }
    vp[m] = make_pair(0,0);
    vp[m+1] = make_pair(n+1,n+1);
    sort(vp.begin(), vp.end());

    for (int i = 1; i < vp.size() -1 ; i++)
    {
        if (vp[i-1].second < vp[i].first - 1)
        {
            long long cand = abs(s - (vp[i].first - 1));
            if (cand < msf)
            {
                msf = cand;
                res = vp[i].first - 1;

            }
        }
        if (vp[i+1].first > vp[i].second + 1)
        {
            long long cand = abs(s - (vp[i].second + 1));
            if (cand < msf)
            {
                msf = cand;
                res = vp[i].second + 1;

            }
        }
    }
    cout << res << endl;

    return 0;
}