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
#include <iostream>
#include <algorithm>

using namespace std;

const int NMAX = 1007;

pair<long long,long long> arr[NMAX];

int main(){
    ios_base::sync_with_stdio(0);
    
    long long n, s, a, b, answer, dis;
    int m;

    cin>>n>>m>>s;

    dis = n+1;

    for(int i=0;i<m;i++){
        cin>>a>>b;
        arr[i] = {a, b};
    }
    sort(arr,arr+m);

    for(int i=0;i<m;i++){
        long long left = arr[i].first;
        long long right = arr[i].second;

        if((i == 0 && left != 1) || (i != 0 && left - 1 != arr[i-1].second)){
            if(abs(left - 1 - s) < dis){
                dis = abs(left - 1 - s);
                answer = left - 1;
            }
        }
        if((i == m-1 && right != n) || (i != m-1 && right + 1 != arr[i+1].first)){
            if(abs(right + 1 - s) < dis){
                dis = abs(right + 1 - s);
                answer = right + 1;
            }
        }
    }

    cout<<answer;

    return 0;
}