求助 只有10分

P1803 凌乱的yyy / 线段覆盖

@[Gent7c](/user/1172582) ```cpp #include<iostream> #include<algorithm> using namespace std; struct node { int start; int end; }a[2000000]; bool compare(node n1, node n2) { return n1.end < n2.end; } int main() { int n, mi, cnt = 0; cin >> n; for (int i = 1; i <= n; i++) cin >> a[i].start >> a[i].end; sort(a + 1, a + 1 + n, compare); mi = -1; for (int i = 1; i <= n; i++) { if (a[i].start >= mi) { cnt++; mi = a[i].end; } } cout << cnt; } ```
by WydnksqhbD @ 2024-05-17 15:42:33


|