[C++] 백준 2696 (정렬 풀이)

문제 소스 코드 #include <iostream> #include <vector> #include <string> #include <algorithm> using namespace std; int** min_heap; int cursor = 0; void push(int arr[], int key) { arr[cursor++] = key; return ; } int main() { vector<int> ans; vector<int> q; int T; scanf("%d", &T); min_heap = new int*[T]; for(int i=0;i<T;i++) { int M; scanf("%d", &M); int number = int(M/2) + 1; ans.push_back(number); min_heap[i] = new int[M]; for(int j=1;j<M+1;j++) { int element; scanf("%d", &element); push(min_heap[i],ele...

원문링크 : [C++] 백준 2696 (정렬 풀이)