BOJ 1946 - 신입 사원 [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
 
void solve(void) {
  int n;
  cin >> n;
  vector<pair<int, int> > a(n);
  for (int i=0; i<n; i++) {
    cin >> a[i].first >> a[i].second;
  }
 
  sort(a.begin(), a.end());
 
  int ans = 1, cur = 0;
  for (int i=1; i<n; i++) {
    if (a[i].second >= a[cur].second) continue;
    cur = i;
    ans++;
  }
  cout << ans << "\n";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}