log log

오늘은 leetcode의 Two City Scheduling을 풀어보았다. There are 2N people a company is planning to interview. The cost of flying the i-th person to city A is costs[i][0], and the cost of flying the i-th person to city B is costs[i][1]. Return the minimum cost to fly every person to a city such that exactly N people arrive in each city input : [[10,20],[30,200],[400,50],[30,20]] outpupt : 110 인터뷰를 위해 회사로 가야하..