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
#include<bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n, m, s;
    cin >> n >> m >> s;
    vector<pair<ll, ll>> przedz;
    vector<ll> to_check;
    for(int i=0; i<m; i++){
        ll l, r;
        cin >> l >> r;
        przedz.push_back({l, r});
        to_check.push_back(l-1);
        to_check.push_back(r+1);
    }
    ll best = 1e18;
    ll odp = -1;
    sort(to_check.begin(), to_check.end());
    for(auto e : to_check){
        if((e<1)||(e>n)) continue;
        bool gicior = 1;
        for(auto p : przedz){
            if((e>=p.first)&&(e<=p.second)){
                gicior=0;
                break;
            }
        }
        if(gicior){
            ll prop = abs(e-s);
            if(prop<best){
                best = prop;
                odp = e;
            }
        }
    }
    cout << odp <<"\n";
}