http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1508&sca=99&sfl=wr_hit&stx=2247 JUNGOL www.jungol.co.kr #include struct time { int min, max; } stdt[10010], sol[10010], tmp[10010]; int N, solnum, longtime, emptytime; void mergesort(int s, int e) { int m = (s + e) / 2, k = s, a = s, b = m + 1; if (s >= e) return; mergesort(s, m); mergesort(m + 1, e); while (a