Codeforces Round #274 (Div. 2) c Exams

點擊打開鏈接鏈接

C. Exams

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Student Valera is an undergraduate student at the University. His end of term exams are approaching and he is to pass exactly n exams. Valera is a smart guy, so he will be able to pass any exam he takes on his first try. Besides, he can take several exams on one day, and in any order.

According to the schedule, a student can take the exam for the i-th subject on the day number a_i. However, Valera has made an arrangement with each teacher and the teacher of the i-th subject allowed him to take an exam before the schedule time on day b_i (b_i < a_i). Thus, Valera can take an exam for the i-th subject either on day a_i, or on dayb_i. All the teachers put the record of the exam in the student's record book on the day of the actual exam and write down the date of the mark as number a_i.

Valera believes that it would be rather strange if the entries in the record book did not go in the order of non-decreasing date. Therefore Valera asks you to help him. Find the minimum possible value of the day when Valera can take the final exam if he takes exams so that all the records in his record book go in the order of non-decreasing date.

Input

The first line contains a single positive integer n (1 ≤ n ≤ 5000) — the number of exams Valera will take.

Each of the next n lines contains two positive space-separated integers a_i and b_i (1 ≤ b_i < a_i ≤ 10⁹) — the date of the exam in the schedule and the early date of passing the i-th exam, correspondingly.

Output

Print a single integer — the minimum possible number of the day when Valera can take the last exam if he takes all the exams so that all the records in his record book go in the order of non-decreasing date.

Sample test(s)

input

3
5 2
3 1
4 2

output

2

input

3
6 1
5 2
4 3

output

6

Note

In the first sample Valera first takes an exam in the second subject on the first day (the teacher writes down the schedule date that is 3). On the next day he takes an exam in the third subject (the teacher writes down the schedule date, 4), then he takes an exam in the first subject (the teacher writes down the mark with date 5). Thus, Valera takes the last exam on the second day and the dates will go in the non-decreasing order: 3, 4, 5.

In the second sample Valera first takes an exam in the third subject on the fourth day. Then he takes an exam in the second subject on the fifth day. After that on the sixth day Valera takes an exam in the first subject.

小明要考n次試 老師能讓他提前考 a[i]代表大家考的時間 b[i]代表能提前到的時間 但是在成績單上記錄的是a[i]

小明要求成績單上記錄的每科考試時間必須爲非遞減

問最快什麼時候能完成考試

按照 a排序 若a相同則按照b排序

然後貪心

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