#include<iostream> #include<vector> #include<algorithm> using namespace std; typedef long long int ll; vector<pair<ll,ll>> intrv; vector<ll> poss; int main(){ ll n, m, s; cin >> n >> m >> s; for(int i = 0; i < m; i++){ ll a, b; cin >> a >> b; intrv.push_back({a,b}); } sort(intrv.begin(),intrv.end()); for(int i = 0; i < m; i++){ ll a = intrv[i].first-1; ll b = intrv[i].second+1; if(i == 0){ if(a != 0){ poss.push_back(a); } } else{ if(intrv[i-1].second != a){ poss.push_back(a); } } if(i == m-1){ if(b != n+1){ poss.push_back(b); } } else{ if(intrv[i+1].first != b){ poss.push_back(b); } } } ll res = n; ll res_dist = n; for(ll house : poss){ if(abs(house - s) < res_dist){ res_dist = abs(house - s); res = house; } } cout << res; return 0; }
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 55 56 57 58 | #include<iostream> #include<vector> #include<algorithm> using namespace std; typedef long long int ll; vector<pair<ll,ll>> intrv; vector<ll> poss; int main(){ ll n, m, s; cin >> n >> m >> s; for(int i = 0; i < m; i++){ ll a, b; cin >> a >> b; intrv.push_back({a,b}); } sort(intrv.begin(),intrv.end()); for(int i = 0; i < m; i++){ ll a = intrv[i].first-1; ll b = intrv[i].second+1; if(i == 0){ if(a != 0){ poss.push_back(a); } } else{ if(intrv[i-1].second != a){ poss.push_back(a); } } if(i == m-1){ if(b != n+1){ poss.push_back(b); } } else{ if(intrv[i+1].first != b){ poss.push_back(b); } } } ll res = n; ll res_dist = n; for(ll house : poss){ if(abs(house - s) < res_dist){ res_dist = abs(house - s); res = house; } } cout << res; return 0; } |