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
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maint = 1'000'000'000'003;

vector < pair < ll, ll > > v;

int main(){
    ll n, m, s;
    cin >> n >> m >> s;
    ll mi = maint, gdzie = -1;
    for(int i = 0; i < m; i++){
        ll l, r;
        cin >> l >> r;
        v.push_back({l, r});
    }
    sort(v.begin(), v.end());
    for(int i = 0; i < m; i++){
        if(i > 0){
            if(v[i - 1].second + 1 < v[i].first){
                if(mi > abs(s - v[i].first + 1)){
                    gdzie = v[i].first - 1;
                    mi = abs(s - v[i].first + 1);
                }
            }
        }
        else if(v[i].first > 1){
            if(mi > abs(s - v[i].first + 1)){
                gdzie = v[i].first - 1;
                mi = abs(s - v[i].first + 1);
            }
        }
        if(i < m - 1){
            if(v[i + 1].first > v[i].second + 1){
                if(mi > abs(s - v[i].second - 1)) {
                    gdzie = v[i].second + 1;
                    mi = abs(s - v[i].second - 1);
                }
            }
        }
        else if(v[i].second < n){
            if(mi > abs(s - v[i].second - 1)) {
                gdzie = v[i].second + 1;
                mi = abs(s - v[i].second - 1);
            }
        }
    }
    cout << gdzie << "\n";
}