Given a list of activities as [start, end] pairs, return the maximum number of non-overlapping activities you can select using a greedy approach.