Activity Selection Problem (N meetings in one room)

activity_selection_problem.cpp

int maxMeetings(int start[], int end[], int n) {
  
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);

    sort(order.begin(), order.end(), [&](int a, int b)  -> bool {
        return end[a] < end[b]; 
    });

    pair<int, int> last = {start[order[0]], end[order[0]]};

    int ans = 1;

    for(int i=1; i<n; i++) {
        int s = start[order[i]];
        int f = end[order[i]];

        if(last.second < s) {
            last = {s, f};
            ans += 1;
        }
    }

    return ans;
}