[백준 1931] 회의실 배정

https://www.acmicpc.net/problem/1931

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
    int n;
    cin >> n;
    int* start = new int[n];
    int* end = new int[n];
 
    vector<pair<int, int> > order;
    for (int i = 0; i < n; i++) {
        cin >> start[i] >> end[i];
        order.push_back(make_pair(end[i], start[i]));
    }
 
    sort(order.begin(), order.end());
 
    int earliest = 0, selected = 0;
    for (int i = 0; i < order.size(); i++) {
        int meetingBegin = order[i].second, meetingEnd = order[i].first;
        if (earliest <= meetingBegin){
            earliest = meetingEnd;
            selected++;
        }
    }
 
    cout << selected << endl;
 
}