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
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
using namespace std;
long long n,m,s,l[1001],r[1001];
long long kingznak=1;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m>>s;
    long long king=1000000000002,ind;
    for(int i=0;i<m;i++){
    	cin>>l[i]>>r[i];
	}
	std::sort(l,l+m);
	std::sort(r,r+m);
    for(int i=0;i<m;i++){
    	
    	if(abs(s-l[i])<king&&l[i]!=1&&r[i-1]!=l[i]-1){
    		king = abs(s-l[i]);
    		ind=l[i]-1;
		}
		if(abs(s-r[i])<king&&r[i]!=n&&l[i+1]!=r[i]+1){
			king = abs(s-r[i]);
			kingznak=1;
			ind=r[i]+1;
		}
	}
	cout<<ind;
    
    
    return 0;
}