Activity Selection Program in C++

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

// Structure to represent an activity with start and end times
struct Activity {
    int start;
    int end;
};

// Function to compare activities based on their end times
bool compareActivities(const Activity& a, const Activity& b) {
    return a.end < b.end;
}

// Function to solve the Activity Selection Problem
void activitySelection(std::vector<Activity>& activities) {
    // Sort the activities based on their end times
    std::sort(activities.begin(), activities.end(), compareActivities);

    // The first activity is always selected
    int n = activities.size();
    std::cout << "Selected Activities: ";
    int i = 0;
    std::cout << "(" << activities[i].start << ", " << activities[i].end << ") ";

    // Consider the rest of the activities
    for (int j = 1; j < n; j++) {
        // If this activity has a start time greater than or equal to the end time of the previously selected activity,
        // then select it
        if (activities[j].start >= activities[i].end) {
            std::cout << "(" << activities[j].start << ", " << activities[j].end << ") ";
            i = j;
        }
    }
    std::cout << std::endl;
}

int main() {
    std::vector<Activity> activities = {
        {1, 2},
        {3, 4},
        {0, 6},
        {5, 7},
        {8, 9},
        {5, 9}
    };

    std::cout << "Activities: " << std::endl;
    for (const Activity& activity : activities) {
        std::cout << "(" << activity.start << ", " << activity.end << ") ";
    }
    std::cout << std::endl;

    activitySelection(activities);

    return 0;
}