Kopfkino

Activity Selection  #include <iostream> #include <vector> #include <algorithm> using namespace std; struct Activity {     int start, end; }; bool compare(Activity a, Activity b) {     return a.end < b.end; } int main() {     int n;     cin >> n;     vector<Activity> activities(n);     for (int i = 0; i < n; i++)         cin >> activities[i].start >> activities[i].end;     sort(activities.begin(), activities.end(), compare);     int count = 1;     int last_end = activities[0].end;     for (int i = 1; i < n; i++) {         if (activities[i].start >= last_end) {             count++;             last_end = activities[i].end;         }     }     cout << count << endl;     retu...