- C++
题解一
- 2025-7-6 15:53:41 @
#include #include #include using namespace std;
struct Segment { int start; int end; };
bool compareByEnd(const Segment& a, const Segment& b) { return a.end < b.end; }
int main() { int n; cin >> n; vector segments(n); for (int i = 0; i < n; i++) { cin >> segments[i].start >> segments[i].end; } sort(segments.begin(), segments.end(), compareByEnd); int count = 0; int lastEnd = -1; for (const auto& seg : segments) { if (seg.start >= lastEnd) { count++; lastEnd = seg.end; } } cout << count << endl; return 0; }
1 条评论
-
xly3027 LV 5 @ 2025-7-7 18:35:32
希丰展?用markdown
- 1