题解 | 活动安排
活动安排
https://www.nowcoder.com/practice/16d971e9e42e4f3b9b1e2b8794796a43
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int>> v(n + 1);
vector<int> g(n + 1);
g[0] = 0;
for (int i = 1; i <= n ; i++) cin >> v[i].first >> v[i].second;
sort(v.begin() + 1, v.end(), [&](pair<int, int> a, pair<int, int> b) {
return a.second < b.second;
});
int ans = 0, pre = 0;
for (int i = 1; i <= n; i++) if (v[i].first >= pre) ans++, pre = v[i].second;
cout << ans << endl;
}
查看12道真题和解析