http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1760&sca=99&sfl=wr_hit&stx=2499 JUNGOL www.jungol.co.kr #include int N, Cnt, arr[1010], arr2[1010], sum; void mergesort(int s, int e) { if (s >= e) return; int m = (s + e) / 2; mergesort(s, m); mergesort(m + 1, e); int k = s, a = s, b = m + 1; while (a