Submission #3422482

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
#define MAX_N 100000
#define MAX_M 100000
pair<int, int> itv[MAX_M];
int main(){
  int N, M, ans = 0;
  cin >> N >> M;
  int a[MAX_M], b[MAX_M];
  for(int i = 0; i < M; i++){
    cin >> a[i] >> b[i];
    itv[i].first = b[i], itv[i].second = a[i];
  }
  sort(itv, itv + M);
  int island = 0;
  for(int i = 0; i < M; i++){
    if(island <= itv[i].second){
      island = itv[i].first;
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result