19598번

19598

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

bool compare(pair<int, int> p1, pair<int, int> p2)
{
    if (p1.first == p2.first)
    {
        return p1.second < p2.second;
    }
    else
    {
        return p1.first < p2.first;
    }
}

int main()
{
    int n;
    int answer = 0;
    vector<pair<int, int>> v;
    vector<int> visitEnd;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int start, end;
        cin >> start >> end;
        v.push_back(make_pair(start, end));
    }

    sort(v.begin(), v.end(), compare);

    for (int i = 0; i < n; i++)
    {
        int startNum = v[i].first;
        int endNum = v[i].second;
        bool isPossible = false;
        for (int j = 0; j < visitEnd.size(); j++)
        {
            if (visitEnd[j] <= startNum)
            {
                isPossible = true;
                visitEnd[j] = endNum;
                break;
            }
        }
        if (!isPossible)
        {
            answer++;
            visitEnd.push_back(endNum);
        }
    }
    cout << answer;
}