문제 링크 https://www.acmicpc.net/problem/9870 9870번: Vacation Planning Air Bovinia is planning to connect the N farms (1 > A >> B; int Cur = INF; for (int i = 1; i