Notice
Recent Posts
Recent Comments
Link
목록우선순위큐 (1)
Dev.baelanche
[백준 11000] 강의실 배정
#include #include #include using namespace std; pair a[200000]; priority_queue pq; bool compare(pair a, pair b) { if (a.first > n; for (int i = 0; i > a[i].first >> a[i].second; sort(a, a + n, compare); for (int i = 0; i < n; i++) { int end = a[i].second; if (!pq.empty() &..
Data Structure & Algorithm/PS - C++
2021. 4. 8. 17:09