//贪心算法
//题目:给定一组活动,每个活动有开始时间和结束时间,选择最多的互不冲突的活动。
//
//问题函数定义:
//
//cpp
//int maxActivities(vector<pair<int, int>>& activities);
//重点是先按结束时间排序,在依次选取
//裁判测试程序样例:
//
//cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
bool na(pair<int, int> a, pair<int, int> b) {
return a.second < b.second;
}
int maxActivities(vector<pair<int, int>>& activities) {
sort(activities.begin(), activities.end(), na);
int count=1;
int k = 0;
for (int i = 1; i < activities.size(); i++) {
if (activities[i].first >= activities[k].second) {
count++;
k = i;
}
}
return count;
}
int main() {
vector<pair<int, int>> activities = { {1, 2}, {3, 4}, {0, 6}, {5, 7}, {8, 9}, {5, 9} };
cout << maxActivities(activities) << endl;
return 0;
}
//输入样例:
//
//(1, 2) (3, 4) (0, 6) (5, 7) (8, 9) (5, 9)
//输出样例:
//
//4