백준 골드5 회의실 배정 1913

 

git : https://github.com/kwon1232/CodingTest/tree/main/%EB%B0%B1%EC%A4%80/Gold/1931.%E2%80%85%ED%9A%8C%EC%9D%98%EC%8B%A4%E2%80%85%EB%B0%B0%EC%A0%95

CodingTest/백준/Gold/1931. 회의실 배정 at main · kwon1232/CodingTest

 

#include <string>
#include <vector>
#include <iostream>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <unordered_map>
#include <set>
#include <regex>
#include <sstream>
#include <tuple>
#include <cmath>


using namespace std;


int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    std::cout.tie(NULL);

    int n;
    
    cin >> n;

    vector<pair<int, int>> conferenceRoom(n);


    for (int i = 0; i < n; i++)
    {
        cin >> conferenceRoom[i].second;
        cin >> conferenceRoom[i].first;
    }

    sort(conferenceRoom.begin(), conferenceRoom.end());

    int count = 0;
    int end = -1;

    for (int i = 0; i < n; i++)
    {
        if (conferenceRoom[i].second >= end)
        {
            end = conferenceRoom[i].first;
            count++;
        }
    }

    cout << count;

    
    return 0;
}

 

 

문제 출저 : 

https://www.acmicpc.net/problem/1931