-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathB_Big_Segment.cpp
86 lines (76 loc) · 2.14 KB
/
B_Big_Segment.cpp
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
const long long mod = 1e9 + 7;
#define INF (1LL << 60)
#define inf (1 << 30)
#define all(x) (x).begin(), (x).end()
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << " "; _print(x); cerr << endl;
#else
#define debug(x)
#endif
void _print(ll t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(lld t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(ull t) { cerr << t; }
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {
cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";
}
template <class T> void _print(vector <T> v) {
cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";
}
template <class T> void _print(set <T> v) {
cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";
}
template <class T> void _print(multiset <T> v) {
cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";
}
template <class T, class V> void _print(map <T, V> v) {
cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";
}
void solve(){
int n;
cin>>n;
int mn=INT_MAX;
int mx=INT_MIN;
vector<pair<int,int>> vec(n);
for(int i=0;i<n;i++){
int u,v;
cin>>u>>v;
vec[i]={u,v};
mn=min(mn,u);
mx=max(mx,v);
}
bool found=false;
for(int i=0;i<n;i++){
if(vec[i].first<=mn && vec[i].second>=mx){
found=true;
cout<<i+1<<"\n";
return;
}
}
cout<<-1<<"\n";
}
int main() {
#ifndef ONLINE_JUDGE
freopen("Error.txt", "w", stderr);
#endif
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
int test=1;
// cin>>test;
while(test--){
solve();
}
return 0;
}