-
Notifications
You must be signed in to change notification settings - Fork 0
/
Exams.cpp
43 lines (42 loc) · 869 Bytes
/
Exams.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
/*
Author: Sanskar Agarwal
Nick: sanskaragarwal
Birla Institute Of Technology, Mesra
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F(i,a,b) for(ll i = (ll)(a); i <= (ll)(b); i++)
#define RF(i,a,b) for(ll i = (ll)(a); i >= (ll)(b); i--)
#define INF 100009
#define mod 1000000007
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff first
#define ss second
int main()
{
fast
int n;
cin>>n;
pair<int, int> p[n];
int day;
for(int i=0;i<n;++i)
{
cin>>p[i].first;
cin>>p[i].second;
}
sort(p, p+n);
day=p[0].second;
for(int i=1;i<n;++i)
{
if(p[i].second<day)
day=p[i].first;
else
day=p[i].second;
}
cout<<day<<endl;
return 0;
}