http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1245&sca=99&sfl=wr_hit&stx=1972 JUNGOL www.jungol.co.kr #include int ar[100010], ans[100010], N, C; void mergesort(int* pArr, int s, int e) { if (s >= e) return; int m = (s + e) / 2; mergesort(pArr, s, m); mergesort(pArr, m + 1, e); int i = s, j = m + 1, k = s; while (i