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 <bits/stdc++.h>
using namespace std;

vector<pair<long long,long long>> t;
vector<pair<long long,long long>> result;

int main(){
    ios_base::sync_with_stdio(0);
    long long n,m,s; cin >> n >> m >> s;
    for(int i=0;i<m;i++){
        long long a,b; cin >> a >> b;
        t.push_back({a,b});
    }
    sort(t.begin(),t.end());

    for(long long i=0;i<t.size();i++){
        if (!result.empty() && t[i].first <= result.back().second+1) {
            result.back().second = max(result.back().second, t[i].second);
        }
        else{
            result.push_back(t[i]);
        }
    }

    /*for(int i=0;i<result.size();i++){
        cout << result[i].first << " " << result[i].second << "\n";
    }*/

    long long wynik = n*10;
    for(int i=0;i<result.size();i++){
        if(abs(s-wynik)>abs(s-(result[i].first-1))){
            if(result[i].first>1)
                wynik = result[i].first-1;
        }
        if(abs(s-wynik)>abs(s-(result[i].second+1))){
            if(result[i].second<n)
                wynik = result[i].second+1;
        }
    }
    cout << wynik;
}