Greedy | Striver’s SDE Sheet

class Solution
{
    public:
    int maxMeetings(int start[], int end[], int n)
    {
       pair<int, int> a[n + 1];

       for(int i=0; i<n; i++)
       {
           a[i].first = end[i];
           a[i].second = start[i];
       }

       sort(a, a+n);
       int ans = 1, end_time = a[0].first;

       for (int i = 1; i < n; i++)
            if ( a[i].second > end_time) {
                ans++;
                end_time = a[i].first;
            }
        return ans;

    }
};