Talk is cheap.

func findNumbersWithSum(nums []int, target int) []int {
    i, j := 0, len(nums) - 1
    res := []int{}
    sort.Ints(nums)
    for i < j {
        tmp := nums[i] + nums[j]
        if tmp > target {
            j -= 1
        } else if tmp == target {
            res = append(res, nums[i], nums[j])
            return res
        } else {
            i += 1
        }
    }
    return res
}