1 solutions
-
0
Guest MOD
-
3
代码:
#include<bits/stdc++.h> using namespace std; const int N=1e5+2; int n,l,cnt; struct asd{ int s,t; }; asd a[N]; bool cmp(asd x,asd y){ return x.t<y.t; } int main() { ios::sync_with_stdio(0); cin>>n; for(int i=0;i<n;i++) cin>>a[i].s>>a[i].t; sort(a,a+n,cmp); l=a[0].t; cnt=1; for(int i=1;i<n;i++){ if(a[i].s>=l){ l=a[i].t; cnt++; } } cout<<cnt; return 0; }
- 1
Information
- ID
- 50
- Time
- 1000ms
- Memory
- 512MiB
- Difficulty
- 4
- Tags
- # Submissions
- 31
- Accepted
- 17
- Uploaded By