480A - Exams - CodeForces Solution


greedy sortings *1400

Please click on ads to support us..

C++ Code:

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<algorithm>

#define ll long long 
#define ii int

#define vll vector<ll>
#define vint vector<int>
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()

#define fr1(i, s, n, e) for(ll i=s;i>=n;i-=e)
#define fr3(i, s, n, e) for(ll i=s;i<n;i+=e)
#define fore(i, l, r) for(ii i = ii(l); i < ii(r); i++)

#define fi(vector) for(auto &i : vector)
#define fo(vector) for(auto d : vector)

#define FIO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);

using namespace std;

void FAISAL()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
}

int main()
{
    FAISAL();
    ll n, best = 0; cin >> n;
    vector < pair < ll, ll >>v(n);
    for (auto& [a, b] : v)
        cin >> a >> b;

    sort(all(v));
    fore(i, 0, n)
    {
        if (best <= v[i].second)
            best = v[i].second;
        else
            best = v[i].first;
    }
    cout << best;
}


Comments

Submit
0 Comments
More Questions

380C - Sereja and Brackets
1281B - Azamon Web Services
1702A - Round Down the Price
1681C - Double Sort
12A - Super Agent
1709A - Three Doors
1680C - Binary String
1684B - Z mod X = C
1003A - Polycarp's Pockets
1691B - Shoe Shuffling
1706A - Another String Minimization Problem
1695B - Circle Game
1702B - Polycarp Writes a String from Memory
1701A - Grass Field
489C - Given Length and Sum of Digits
886B - Vlad and Cafes
915A - Garden
356A - Knight Tournament
1330A - Dreamoon and Ranking Collection
1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String
1708B - Difference of GCDs
863A - Quasi-palindrome
1478A - Nezzar and Colorful Balls
1581B - Diameter of Graph
404A - Valera and X
908A - New Year and Counting Cards