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

using namespace std;

int main() {
    long long n, m, s;
    cin >> n >> m >> s;
    vector<pair<long long, long long>> intervals(m);

    for (int i = 0; i < m; ++i) {
        cin >> intervals[i].first >> intervals[i].second;
    }

    long long min_dist = LLONG_MAX;
    long long best_p = -1;

    for (long long p = 1; p <= n; ++p) {
        bool is_free = true;
        for (const auto& interval : intervals) {
            if (p >= interval.first && p <= interval.second) {
                is_free = false;
                break;
            }
        }
        if (is_free) {
            long long dist = abs(s - p);
            if (dist < min_dist) {
                min_dist = dist;
                best_p = p;
            }
        }
    }

    cout << best_p << endl;
    return 0;
}