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
#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    set<long long> occupied;

    long long n, m, s;
    cin >> n >> m >> s;

    long long best = 0, best_val = n + 1;

    for (long long i = 0; i < m; i++)
    {
        long long a, b;
        cin >> a >> b;
        for (long long j = a; j <= b; j++)
        {
            occupied.insert(j);
        }
    }

    for (long long i = 1; i <= n; i++)
    {
        if (occupied.contains(i))
        {
            continue;
        }
        long long diff = abs(s - i);
        if (diff < best_val)
        {
            best = i;
            best_val = diff;
        }
    }

    cout << best << '\n';
}