def__dfs(self, left, right, nums, method, time): if left == right: self.min_time = min(time, self.min_time) return for cur_method in range(2): cur_time = nums[left][cur_method] if cur_method == method else nums[left][-1] + nums[left][cur_method] time += cur_time if time >= self.min_time: time -= cur_time continue self.__dfs(left + 1, right, nums, cur_method, time) time -= cur_time
if __name__ == "__main__": n = int(sys.stdin.readline().strip()) nums = [] for _ in range(n): nums.append(list(map(int, sys.stdin.readline().strip().split()))) print(Solution().compute_time(nums))
if __name__ == "__main__": n = int(sys.stdin.readline().strip()) nums = [] for _ in range(n): nums.append(list(map(int, sys.stdin.readline().strip().split()))) print(compute_time(n, nums))