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
50
51
52
53
54
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    long long n, m, s;
    cin >> n >> m >> s;

    vector<pair<long long, long long>> intervals;

    for (int i = 0; i < m; ++i) {
        long long l, r;
        cin >> l >> r;
        intervals.emplace_back(l, r);
    }

    long long closest = -1;

    for (long long p = s - 1; p >= 1; --p) {
        bool occupied = false;
        for (const auto &[l, r] : intervals) {
            if (l <= p && p <= r) {
                occupied = true;
                break;
            }
        }
        if (!occupied) {
            closest = p;
            break;
        }
    }

    for (long long p = s + 1; p <= n; ++p) {
        bool occupied = false;
        for (const auto &[l, r] : intervals) {
            if (l <= p && p <= r) {
                occupied = true;
                break;
            }
        }
        if (!occupied) {
            if (closest == -1 || abs(p - s) < abs(closest - s)) {
                closest = p;
            }
            break;
        }
    }

    cout << closest << "\n";

    return 0;
}