Exams CodeForces - 479C

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 5009
typedef struct
{
    int x,y;
}node;
node a[M];
bool cmp(node a,node b)
{
    if(a.x != b.x)
    return a.x < b.x;
    return a.y < b.y;
}
int n;
int main()
{
    while(scanf("%d",&n)==1)
    {
        for(int i = 0;i < n;i++)
        {
            scanf("%d %d",&a[i].x,&a[i].y);
        }
        sort(a,a+n,cmp);
        int ans = 0;
        int temp = a[0].y;
        for(int i = 1;i < n;i++)
        {
            if(a[i].y >= temp)
            {
                temp = a[i].y;
            }
            else
            {
                temp = a[i].x;
            }
        }
        printf("%d\n",temp);
    }
    return 0;
}