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
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, s;
pair <int, int> res = {1e16, 1e16};
pair <int, int> tab[1005];
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> s;
    for (int i = 0; i < m; ++i)
    {
        cin >> tab[i].first >> tab[i].second;
    }
    tab[m] = {n+1, 2*n};
    ++m;
    sort(tab, tab + m);
    int lst = 1;
    for (int i = 0; i < m; ++i)
    {
        if (tab[i].first > lst)
        {
            res = min(res, {abs(lst - s), lst});
            res = min(res, {abs(tab[i].first-1 - s), tab[i].first-1});
        }
        lst = tab[i].second + 1;
    }
    cout << res.second;
}