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
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <list>
#include <vector>
#include <string>
using namespace std;
vector<pair<long long, long long> > zaj;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie();
    long long n, m, s;
    cin>>n>>m>>s;
    for(int i=0; i<m; i++){
        long long l, r;
        cin>>l>>r;
        zaj.push_back(make_pair(l, r));        
    }
    zaj.push_back(make_pair(0, 0));
    zaj.push_back(make_pair(n+1, n+1));
    sort(zaj.begin(), zaj.end());
    long long wyn=10e15, nrd=0;
    for(int i=1; i<zaj.size()-1; i++){
        if(zaj[i-1].second!=zaj[i].first-1){
            if(wyn>abs(s-(zaj[i].first-1))){
                wyn=abs(s-(zaj[i].first-1));
                nrd=zaj[i].first-1;
            }
        }
        if(zaj[i+1].first!=zaj[i].second+1){
            if(wyn>abs(s-(zaj[i].second+1))){
                wyn=abs(s-(zaj[i].second+1));
                nrd=zaj[i].second+1;
            }
        }
    }
    cout<<nrd<<'\n';
    return 0;
}