Codeforces Round #274 (Div. 2) 479C - Exams And 480A. Exams Solution



 

Problem Link: https://codeforces.com/problemset/problem/479/C  or  https://codeforces.com/contest/480/problem/A

Solution in C++: 

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
///**********ALLAH IS ALMIGHTY************///
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,j,ans;
    cin>>n;
    pair<int,int>p[n+9];
    for(i=0; i<n; i++)
    {
        cin>>p[i].first>>p[i].second;
    }
    sort(p,p+n);
    ans=p[0].second;
    for(i=1; i<n; i++)
    {
        if(p[i].second>=ans)
            ans=p[i].second;
        else
            ans=p[i].first;
    }
    cout<<ans<<endl;
}







No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.