Minimum Sum of Mountain Triplet

Given an array of integers nums, find the minimum sum of a mountain triplet in the array. A mountain triplet is a sequence of three indices (i, j, k) such that i < j < k and nums[i] < nums[j] > nums[k]. If no such triplet exists, return -1.