백준 24060 병합 정렬
#include #include using namespace std;int n, m;int countAnswer = 0;int answer = 0;void merge(vector&, int, int, int);void merge_sort(vector& arr, int start, int end){ if (start & arr, int start, int mid, int end){ int i = start; int j = mid + 1; int t = 0; int size = end - start + 1; vector temp(size); while (i > n >> m; vector arr(n); for (int i = 0; i > arr[i]; } merge_sort(arr, 0, arr.size() ..
